Improving Graph Compression for Efficient Resource-Constrained Graph Analytics
Summary: Laconic: a rule-based parallel graph compressor that minimizes memory overhead during compression and produces much smaller graphs to reduce peak memory for analytics. Versus prior work it cuts peak memory (~70%/~66%), speeds rule compression (~93%), and achieves 2.47× compression ratio and 2.12× runtime improvements. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Qian Xu (Renmin University of China)
- 2. Juan Yang (Beijing HaiZhi XingTu Technology Co., Ltd)
- 3. Feng Zhang (Renmin University of China)
- 4. Zheng Chen (Renmin University of China)
- 5. Jiawei Guan (Renmin University of China)
- 6. Kang Chen (Tsinghua University)
- 7. Ju Fan (Renmin University of China)
- 8. Youren Shen (Beijing HaiZhi XingTu Technology Co., Ltd)
- 9. Ke Yang (Beijing HaiZhi XingTu Technology Co., Ltd)
- 10. Yu Zhang (Renmin University of China)
- 11. Xiaoyong Du (Renmin University of China)
BibTeX Citation
@article{xu_vldb24,
title = {{Improving Graph Compression for Efficient Resource-Constrained Graph Analytics}},
author = {Xu, Qian and Yang, Juan and Zhang, Feng and Chen, Zheng and Guan, Jiawei and Chen, Kang and Fan, Ju and Shen, Youren and Yang, Ke and Zhang, Yu and Du, Xiaoyong},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {9},
pages = {2212--2226},
doi = {10.14778/3665844.3665852},
url = {https://doi.org/10.14778/3665844.3665852},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,650 | Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities | 2025 | SIGMOD | 5.8146324e-05 |
| 10,034 | HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search | 2026 | SIGMOD | 5.173224e-05 |
| 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD | 5.093636e-05 |
| 10,481 | Performant Synchronization in Geo-Distributed Databases | 2026 | SIGMOD | 5.093636e-05 |
| 11,194 | Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 21 of 21 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 |
|---|---|---|---|---|
| 1 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 2 | 1,301 | A Memory Efficient Reachability Data Structure Through Bit Vector Compression | 2011 | SIGMOD |
| 3 | 5,415 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD |
| 4 | 10,972 | GraphCSR: A Degree-Equalized CSR Format for Large-scale Graph Processing | 2025 | VLDB |
| 5 | 4,953 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD |
| 6 | 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD |
| 7 | 10,913 | Inference-friendly Graph Compression for Graph Neural Networks | 2025 | VLDB |
| 8 | 4,157 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD |
| 9 | 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 10 | 6,408 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD |