BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers

Summary: BYO enables apples-to-apples benchmarking of 20+ graph containers across 10 large graphs and 10 optimized algorithms, isolating container effects from system confounders. Finds simple B-tree and minimal-API containers nearly match specialized designs, while also measuring dynamic batch-insert throughput. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h3797105ec235545f
Venue: VLDB
Year: 2024
Pagerank: 5.1729898e-05
Overall Rank: 9,462 | 36.39%
DOI: 10.14778/3665844.3665859

Incoming Non-self Citations Over Time

Authors

1. Brian Wheatman (Johns Hopkins University)
2. Xiaojun Dong (University of California Riverside)
3. Zheqi Shen (University of California Riverside)
4. Laxman Dhulipala (University of Maryland)
5. Jakub Łącki (Google)
6. Prashant Pandey (University of Utah)
7. Helen Xu (Georgia Institute of Technology)

BibTeX Citation

@article{wheatman_vldb24,
        title = {{BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers}},
        author = {Wheatman, Brian and Dong, Xiaojun and Shen, Zheqi and Dhulipala, Laxman and Łącki, Jakub and Pandey, Prashant and Xu, Helen},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {9},
        pages = {2307--2320},
        doi = {10.14778/3665844.3665859},
        url = {https://doi.org/10.14778/3665844.3665859},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,638	Enabling Efficient Direct Update on Rule-Based Compressed Graph	2026	SIGMOD	4.9793485e-05
10,813	X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs	2026	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
442	Differential dataflow	2013	CIDR	0.00018210463
1,486	LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms	2016	VLDB	0.00010522557
2,029	Teseo and the Analysis of Structural Dynamic Graphs	2021	VLDB	9.1592382e-05
2,042	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.1416822e-05
3,113	RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s	2021	SIGMOD	7.6351769e-05
3,495	Accelerating Truss Decomposition on Heterogeneous Processors	2020	VLDB	7.2562279e-05
3,847	Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs	2021	SIGMOD	6.9831533e-05
4,400	Shared Arrangements: practical inter-query sharing for streaming dataflows	2020	VLDB	6.6151947e-05
4,777	Tornado: A System For Real-Time Iterative Analysis Over Evolving Data	2016	SIGMOD	6.4184698e-05
6,526	CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression	2023	SIGMOD	5.7559739e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,957	Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment	2025	VLDB
2	12,530	I/O Efficient: Computing SCCs in Massive Graphs	2013	SIGMOD
3	5,065	Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage	2024	SIGMOD
4	1,677	Navigating the Maze of Graph Analytics Frameworks using Massive Graph Datasets	2014	SIGMOD
5	10,638	Enabling Efficient Direct Update on Rule-Based Compressed Graph	2026	SIGMOD
6	8,819	An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs	2025	SIGMOD
7	9,998	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD
8	10,423	Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR	2026	SIGMOD
9	1,963	Fast Iterative Graph Computation with Block Updates	2013	VLDB
10	4,068	Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation	2019	VLDB