Efficient Graph Summarization using Weighted LSH at Billion-Scale
Summary: LDME: a correction-set graph summarization using weighted LSH to dramatically reduce node-merge comparisons. Adds fast best-merge scoring, a sort-based encoding, and tunable compression-speed tradeoffs, achieving up to 53x speedups at high compression and substantial speedups with modest loss. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Quinton Yong
- 2. Mahdi Hajiabadi
- 3. Venkatesh Srinivasan
- 4. Alex Thomo
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,427 | CausaLens: A System for Summarizing Causal DAGs | 2025 | SIGMOD | 4.1945683e-05 |
| 10,581 | Causal DAG Summarization | 2025 | VLDB | 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 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 388 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024662272 |
| 435 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00023260172 |
| 1,579 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011283792 |
| 2,607 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4630211e-05 |
| 5,961 | Generating Preview Tables for Entity Graphs | 2016 | SIGMOD | 5.2549663e-05 |
| 5,968 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 5.2503253e-05 |
| 6,329 | Utility-Driven Graph Summarization | 2019 | VLDB | 5.1077685e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,161 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD | 4.1945683e-05 |
| 435 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00023260172 |
| 5,968 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 5.2503253e-05 |
| 6,985 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD | 4.8729387e-05 |
| 4,716 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB | 5.9755569e-05 |
| 2,607 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4630211e-05 |
| 777 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.0001679862 |
| 6,329 | Utility-Driven Graph Summarization | 2019 | VLDB | 5.1077685e-05 |
| 10,964 | Graph Summarization: Compactness Meets Efficiency | 2024 | SIGMOD | 4.1945683e-05 |
| 388 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024662272 |