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 (University of Victoria)
- 2. Mahdi Hajiabadi (University of Victoria)
- 3. Venkatesh Srinivasan (University of Victoria)
- 4. Alex Thomo (University of Victoria)
BibTeX Citation
@inproceedings{yong_sigmod21,
title = {{Efficient Graph Summarization using Weighted LSH at Billion-Scale}},
author = {Yong, Quinton and Hajiabadi, Mahdi and Srinivasan, Venkatesh and Thomo, Alex},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3457331},
url = {https://dl.acm.org/doi/10.1145/3448016.3457331},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,055 | Causal DAG Summarization | 2025 | VLDB | 5.3251649e-05 |
| 10,708 | CausaLens: A System for Summarizing Causal DAGs | 2025 | SIGMOD | 5.093636e-05 |
| 11,178 | Graph Summarization: Compactness Meets Efficiency | 2024 | SIGMOD | 5.093636e-05 |
| 11,241 | Poligras: Policy-based Graph Summarization | 2024 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 486 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00017692185 |
| 548 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016694936 |
| 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011118804 |
| 2,148 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 9.0825156e-05 |
| 5,751 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 6.0994565e-05 |
| 6,201 | Generating Preview Tables for Entity Graphs | 2016 | SIGMOD | 5.9455064e-05 |
| 6,266 | Utility-Driven Graph Summarization | 2019 | VLDB | 5.9355329e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 2 | 486 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD |
| 3 | 5,751 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB |
| 4 | 6,408 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD |
| 5 | 4,581 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 6 | 2,148 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD |
| 7 | 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 8 | 6,266 | Utility-Driven Graph Summarization | 2019 | VLDB |
| 9 | 11,178 | Graph Summarization: Compactness Meets Efficiency | 2024 | SIGMOD |
| 10 | 548 | Graph Summarization with Bounded Error | 2008 | SIGMOD |