A Hierarchical Contraction Scheme for Querying Big Graphs
Summary: Hierarchical contraction for single-machine graph queries; contract subgraphs into supernodes to form an in-memory hierarchy with per-Q synopses. Maintains bounded incremental updates; demonstrates exact answers with 7.6% memory and 9.8x speedups, up to 120x vs 6-machine parallel systems. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan
- 2. Yuanhao Li
- 3. Muyang Liu
- 4. Can Lu
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,985 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD | 4.8729387e-05 |
| 9,484 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3341665e-05 |
| 10,085 | GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries | 2026 | SIGMOD | 4.1945683e-05 |
| 11,026 | Improving Graph Compression for Efficient Resource-Constrained Graph Analytics | 2024 | VLDB | 4.1945683e-05 |
| 11,031 | Poligras: Policy-based Graph Summarization | 2024 | VLDB | 4.1945683e-05 |
| 11,224 | Homomorphic Compression: Making Text Processing on Compression Unlimited | 2023 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,138 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD | 5.1915368e-05 |
| 2,849 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS | 8.0195487e-05 |
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 3,394 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.1480446e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |
| 1,579 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011283792 |
| 8,146 | MiniGraph: Querying Big Graphs with a Single Machine | 2023 | VLDB | 4.5755031e-05 |
| 4,836 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD | 5.8896897e-05 |
| 4,211 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3563454e-05 |