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: 6079
Venue: SIGMOD
Year: 2021
Pagerank: 5.7445683e-05
Overall Rank: 5,030 | 65.05%
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
7,179	A Hierarchical Contraction Scheme for Querying Big Graphs	2022	SIGMOD	4.803776e-05
10,085	GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries	2026	SIGMOD	4.1905499e-05
10,967	Graph Summarization: Compactness Meets Efficiency	2024	SIGMOD	4.1905499e-05
11,034	Poligras: Policy-based Graph Summarization	2024	VLDB	4.1905499e-05
11,141	Neighborhood-Preserving Graph Sparsification	2024	VLDB	4.1905499e-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.00030020929
387	Graph Summarization with Bounded Error	2008	SIGMOD	0.00024682268
435	Efficient Aggregation for Graph Summarization	2008	SIGMOD	0.00023268266
588	Massive Graph Triangulation	2013	SIGMOD	0.00019588834
727	GRAIL: Scalable Reachability Index for Large Graphs	2010	VLDB	0.00017462279
749	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017193776
784	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016648392
865	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00015775653
1,125	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00013829006
1,522	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.0001152219
1,572	Query Preserving Graph Compression	2012	SIGMOD	0.00011296109
1,715	CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching	2019	SIGMOD	0.00010776518
1,879	TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph	2013	SIGMOD	0.00010227906
2,021	Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs	2015	VLDB	9.7730473e-05
3,439	Incremental Graph Computations: Doable and Undoable	2017	SIGMOD	7.0916563e-05
7,926	Data Management for Social Networking	2016	PODS	4.6107647e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,551	A Memory Efficient Reachability Data Structure Through Bit Vector Compression	2011	SIGMOD	0.00011395294
502	On Graph Query Optimization in Large Networks	2010	VLDB	0.00021528261
10,161	Enabling Efficient Direct Update on Rule-Based Compressed Graph	2026	SIGMOD	4.1905499e-05
6,983	CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression	2023	SIGMOD	4.8682622e-05
7,595	DAG Reduction: Fast Answering Reachability Queries	2017	SIGMOD	4.6980168e-05
387	Graph Summarization with Bounded Error	2008	SIGMOD	0.00024682268
11,141	Neighborhood-Preserving Graph Sparsification	2024	VLDB	4.1905499e-05
773	Local Graph Sparsification for Scalable Clustering	2011	SIGMOD	0.00016788213
7,179	A Hierarchical Contraction Scheme for Querying Big Graphs	2022	SIGMOD	4.803776e-05
1,572	Query Preserving Graph Compression	2012	SIGMOD	0.00011296109