Revisiting the Design of In-Memory Dynamic Graph Storage
Summary: Proposes a common abstraction and test framework to compare in-memory dynamic graph storage (LLAMA, Aspen, LiveGraph, Teseo, Sortledton) for read/write, space, and concurrency. Shows large memory overhead (Aspen 3.3–10.8x CSR; fine-grained 4.1–8.9x), architecture-aware bottlenecks, and high-degree vertex contention, suggesting future directions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jixian Su (Shanghai Jiao Tong University)
- 2. Chiyu Hao (Shanghai Jiao Tong University)
- 3. Shixuan Sun (Shanghai Jiao Tong University)
- 4. Hao Zhang (Huawei)
- 5. Sen Gao (National University of Singapore)
- 6. Jiaxin Jiang (National University of Singapore)
- 7. Yao Chen (National University of Singapore)
- 8. Chenyi Zhang (Huawei)
- 9. Bingsheng He (National University of Singapore)
- 10. Minyi Guo (Shanghai Jiao Tong University)
BibTeX Citation
@inproceedings{su_sigmod25,
title = {{Revisiting the Design of In-Memory Dynamic Graph Storage}},
author = {Su, Jixian and Hao, Chiyu and Sun, Shixuan and Zhang, Hao and Gao, Sen and Jiang, Jiaxin and Chen, Yao and Zhang, Chenyi and He, Bingsheng and Guo, Minyi},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709720},
url = {https://dl.acm.org/doi/10.1145/3709720},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,373 | Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single Machine | 2026 | SIGMOD | 5.093636e-05 |
| 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD | 5.093636e-05 |
| 10,489 | RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 25 of 25 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 | 2,141 | Teseo and the Analysis of Structural Dynamic Graphs | 2021 | VLDB |
| 2 | 4,297 | Graph Analytics Through Fine-Grained Parallelism | 2016 | SIGMOD |
| 3 | 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 4 | 3,109 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |
| 5 | 10,207 | Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR | 2026 | SIGMOD |
| 6 | 4,946 | Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage | 2024 | SIGMOD |
| 7 | 1,226 | LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans | 2020 | VLDB |
| 8 | 11,087 | Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment | 2025 | VLDB |
| 9 | 9,624 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB |
| 10 | 6,456 | LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR | 2024 | SIGMOD |