B-Trees Are Back: Engineering Fast and Pageable Node Layouts

Summary: B-Trees re-engineered for fast, pageable nodes handling variable-sized records in hybrid memory–flash systems. Six node-layout optimizations evaluated; adaptive layout rivals in-memory performance for many workloads, in- or out-of-memory. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h0d375d10a1187e9f
Venue: SIGMOD
Year: 2025
Pagerank: 5.1406489e-05
Overall Rank: 9,585 | 35.76%
DOI: 10.1145/3709664

Incoming Non-self Citations Over Time

Authors

1. Marcus Müller (Technical University of Munich)
2. Lawrence Benson (Technical University of Munich)
3. Viktor Leis (Technical University of Munich)

BibTeX Citation

@inproceedings{muller_sigmod25,
        title = {{B-Trees Are Back: Engineering Fast and Pageable Node Layouts}},
        author = {Müller, Marcus and Benson, Lawrence and Leis, Viktor},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3709664},
        url = {https://dl.acm.org/doi/10.1145/3709664},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,417	Replace or Augment: Rethinking the Role of Learned Indexes in Relational Databases	2027	VLDB	4.9605343e-05
10,506	Concurrent Path-Copying Update to Tree Structures	2026	SIGMOD	4.9605343e-05
10,741	Predictive Translation: High-Performance Buffer Management Without the Trade-Offs	2026	SIGMOD	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
68	Making B+-Trees Cache Conscious in Main Memory	2000	SIGMOD	0.00037861537
209	Cache Conscious Indexing for Decision-Support in Main Memory	1999	VLDB	0.00024915373
375	Umbra: A Disk-Based System with In-Memory Performance	2020	CIDR	0.00019660459
504	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory	2016	SIGMOD	0.00017195543
729	Anti-Caching: A New Approach to Database Management System Architecture	2013	VLDB	0.00014393711
1,269	An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory	2016	SIGMOD	0.00011236561
1,328	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	0.00011013165
1,523	Trekking Through Siberia: Managing Cold Data in a Memory-Optimized Database	2014	VLDB	0.00010338554
1,791	Why TPC Is Not Enough: An Analysis of the Amazon Redshift Fleet	2024	VLDB	9.6212919e-05
1,849	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD	9.5008844e-05
1,974	Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory	2022	SIGMOD	9.2725837e-05
2,303	In-Memory Performance for Big Data	2015	VLDB	8.6602545e-05
2,881	Exploiting Directly-Attached NVMe Arrays in DBMS	2020	CIDR	7.8945474e-05
2,934	What Modern NVMe Storage Can Do, And How To Exploit It: High-Performance I/O for High-Performance Storage Engines	2023	VLDB	7.8265774e-05
3,802	B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives	2012	VLDB	6.9914085e-05
4,089	Virtual-Memory Assisted Buffer Management	2023	SIGMOD	6.7968217e-05
6,543	Contention and Space Management in B-Trees	2021	CIDR	5.733215e-05
7,049	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB	5.5967284e-05
9,318	Revisiting B-tree Compression: An Experimental Study	2024	SIGMOD	5.1831862e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,318	Revisiting B-tree Compression: An Experimental Study	2024	SIGMOD
2	11,610	Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives	2024	VLDB
3	6,390	Compact B-Trees	1979	SIGMOD
4	6,649	LSM-Trees and B-Trees: The Best of Both Worlds	2019	SIGMOD
5	5,260	Multi-Disk B-trees	1991	SIGMOD
6	632	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB
7	1,770	Write-Optimized B-Trees	2004	VLDB
8	6,500	Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index	2024	VLDB
9	14,848	Towards an Optimal Data-Structure: CB-trees	1984	VLDB
10	7,049	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB