Graph Summarization: Compactness Meets Efficiency
Summary: Graph summarization with exact reconstruction, targeting the long-standing compactness/efficiency tradeoff. Mags accelerates the greedy, most-compact paradigm with novel design; Mags-DM uses a different practical paradigm, both parallelizable and near-best in compactness at billion-scale. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Deming Chu (University of New South Wales)
- 2. Fan Zhang (Guangdong University of Technology)
- 3. Wenjie Zhang (University of New South Wales)
- 4. Ying Zhang (University of Technology Sydney)
- 5. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@inproceedings{chu_sigmod24,
title = {{Graph Summarization: Compactness Meets Efficiency}},
author = {Chu, Deming and Zhang, Fan and Zhang, Wenjie and Zhang, Ying and Lin, Xuemin},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3654943},
url = {https://dl.acm.org/doi/10.1145/3654943},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,895 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 5.2559789e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 239 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.000235107 |
| 394 | One Trillion Edges: Graph Processing at Facebook-Scale | 2015 | VLDB | 0.00019191286 |
| 497 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00017318153 |
| 563 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016327158 |
| 2,186 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.8916948e-05 |
| 5,075 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD | 6.2860889e-05 |
| 5,554 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD | 6.0858703e-05 |
| 11,554 | Influence Maximization via Vertex Countering | 2024 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,554 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD |
| 2 | 4,647 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 3 | 2,186 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD |
| 4 | 5,924 | Summarizing Answer Graphs Induced by Keyword Queries | 2013 | VLDB |
| 5 | 6,526 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD |
| 6 | 5,660 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB |
| 7 | 497 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD |
| 8 | 563 | Graph Summarization with Bounded Error | 2008 | SIGMOD |
| 9 | 6,388 | Utility-Driven Graph Summarization | 2019 | VLDB |
| 10 | 5,075 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD |