Making Graphs Compact by Lossless Contraction

Summary: Introduces lossless graph contraction into supernodes carrying per-query-class synopses S_Q, enabling exact answers with on-demand decontraction. Generic across label-based or not, local or global queries; adapts existing algorithms (subgraph isomorphism, triangle counting, shortest path) with incremental updates, achieving ~71% compression and ~1.5–2.1x speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6078
Venue: SIGMOD
Year: 2021
Pagerank: 5.8896897e-05
Overall Rank: 4,836 | 66.36%
DOI: 10.1145/3448016.3452797

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,730	A Hierarchical Contraction Scheme for Querying Big Graphs	2022	SIGMOD	4.9479867e-05
10,085	GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries	2026	SIGMOD	4.1945683e-05
10,964	Graph Summarization: Compactness Meets Efficiency	2024	SIGMOD	4.1945683e-05
11,031	Poligras: Policy-based Graph Summarization	2024	VLDB	4.1945683e-05
11,138	Neighborhood-Preserving Graph Sparsification	2024	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
260	Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling	2013	SIGMOD	0.00030040036
388	Graph Summarization with Bounded Error	2008	SIGMOD	0.00024662272
435	Efficient Aggregation for Graph Summarization	2008	SIGMOD	0.00023260172
589	Massive Graph Triangulation	2013	SIGMOD	0.00019576567
733	GRAIL: Scalable Reachability Index for Large Graphs	2010	VLDB	0.00017460741
764	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017018712
788	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016650034
847	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00015993322
1,180	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00013456907
1,561	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.00011358946
1,579	Query Preserving Graph Compression	2012	SIGMOD	0.00011283792
1,775	CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching	2019	SIGMOD	0.00010602927
1,880	TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph	2013	SIGMOD	0.00010226347
2,007	Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs	2015	VLDB	9.8081235e-05
3,394	Incremental Graph Computations: Doable and Undoable	2017	SIGMOD	7.1480446e-05
7,998	Data Management for Social Networking	2016	PODS	4.6101889e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,553	A Memory Efficient Reachability Data Structure Through Bit Vector Compression	2011	SIGMOD	0.00011402871
506	On Graph Query Optimization in Large Networks	2010	VLDB	0.00021475362
10,161	Enabling Efficient Direct Update on Rule-Based Compressed Graph	2026	SIGMOD	4.1945683e-05
6,985	CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression	2023	SIGMOD	4.8729387e-05
7,596	DAG Reduction: Fast Answering Reachability Queries	2017	SIGMOD	4.7016964e-05
11,138	Neighborhood-Preserving Graph Sparsification	2024	VLDB	4.1945683e-05
388	Graph Summarization with Bounded Error	2008	SIGMOD	0.00024662272
777	Local Graph Sparsification for Scalable Clustering	2011	SIGMOD	0.0001679862
6,730	A Hierarchical Contraction Scheme for Querying Big Graphs	2022	SIGMOD	4.9479867e-05
1,579	Query Preserving Graph Compression	2012	SIGMOD	0.00011283792