DBScholar

Back to papers

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)

Paper ID
7125
Venue
SIGMOD
Year
2025
Pagerank
5.4769071e-05
Overall Rank
8,154 | 44.06%
DOI
10.1145/3709720

Incoming Non-self Citations Over Time

Authors

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.

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.

Rank Cited Paper Year Venue Pagerank
3 Pregel: A System for Large-Scale Graph Processing 2010 SIGMOD 0.0012250108
172 High-Performance Concurrency Control Mechanisms for Main-Memory Databases 2012 VLDB 0.00027281663
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
233 Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems 2015 SIGMOD 0.00023815642
264 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00022980015
426 The LDBC Social Network Benchmark: Interactive Workload 2015 SIGMOD 0.00018692185
473 Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores 2015 VLDB 0.00017900942
903 An Empirical Evaluation of In-Memory Multi-Version Concurrency Control 2017 VLDB 0.0001332486
956 Parallelizing Sequential Graph Computations 2017 SIGMOD 0.0001297452
1,226 LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans 2020 VLDB 0.00011589731
1,563 LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms 2016 VLDB 0.00010352314
2,112 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1514258e-05
2,126 Kuzu* Graph Database Management System 2023 CIDR 9.1329991e-05
2,141 Teseo and the Analysis of Structural Dynamic Graphs 2021 VLDB 9.0978534e-05
2,224 An Experimental Study of Bitmap Compression vs. Inverted List Compression 2017 SIGMOD 8.9183396e-05
2,950 An Adaptive Packed-Memory Array 2006 PODS 7.9260861e-05
3,018 The LDBC Social Network Benchmark: Business Intelligence Workload 2023 VLDB 7.8473755e-05
3,027 Sortledton: a Universal, Transactional Graph Data Structure 2022 VLDB 7.8374092e-05
3,068 RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s 2021 SIGMOD 7.7939351e-05
3,778 Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs 2021 SIGMOD 7.1334329e-05
4,544 ByteGraph: A High-Performance Distributed Graph Database in ByteDance 2022 VLDB 6.6382612e-05
4,701 Nanosecond Indexing of Graph Data With Hash Maps and VLists 2019 SIGMOD 6.555048e-05
6,521 BG3: A Cost Effective and I/O Efficient Graph Database in ByteDance 2024 SIGMOD 5.8534756e-05
7,647 GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams 2022 SIGMOD 5.5761394e-05
9,176 HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs 2024 SIGMOD 5.3081996e-05
Previous Page 1 / 1 Next

Semantically Similar Papers