Bounding the Fragmentation of B-Trees Subject to Batched Insertions
Summary: Generalizes Yao’s B-tree fragmentation analysis from random single-key insertions to batched consecutive-key workloads. Shows even leaf splitting remains effective for broad classes, and gives simple provably space-efficient strategies for the rest. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Michael A. Bender (RelationalAI; State University of New York at Stony Brook)
- 2. Aaron Bernstein (New York University)
- 3. Nairen Cao (New York University)
- 4. Alex Conway (Cornell Tech)
- 5. Martín Farach-Colton (New York University)
- 6. Hanna Komlós (Max Planck Institute)
- 7. Yarin Shechter (New York University)
- 8. Nicole Wein (University of Michigan)
BibTeX Citation
@inproceedings{bender_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{Bounding the Fragmentation of B-Trees Subject to Batched Insertions}},
url = {https://dl.acm.org/doi/10.1145/3801894},
doi = {10.1145/3801894},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Bender, Michael A. and Bernstein, Aaron and Cao, Nairen and Conway, Alex and Farach-Colton, Martín and Komlós, Hanna and Shechter, Yarin and Wein, Nicole},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 472 | Optimizing Space Amplification in RocksDB | 2017 | CIDR | 0.000179044 |
| 1,390 | Building a Bw-Tree Takes More Than Just Buzz Words | 2018 | SIGMOD | 0.00010942775 |
| 6,126 | Efficient Bulk Updates on Multiversion B-trees | 2013 | VLDB | 5.9675155e-05 |
| 6,396 | Contention and Space Management in B-Trees | 2021 | CIDR | 5.8870425e-05 |
| 8,255 | B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases | 2023 | VLDB | 5.4574671e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,451 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB |
| 2 | 14,493 | Towards an Optimal Data-Structure: CB-trees | 1984 | VLDB |
| 3 | 9,518 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD |
| 4 | 6,246 | Compact B-Trees | 1979 | SIGMOD |
| 5 | 13,274 | Experiments With B-Tree Reorganization | 1980 | SIGMOD |
| 6 | 13,102 | Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions (Extended Abstract) | 1991 | PODS |
| 7 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 8 | 4,914 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD |
| 9 | 6,396 | Contention and Space Management in B-Trees | 2021 | CIDR |
| 10 | 2,738 | Utilization of B-trees with Inserts, Deletes and Modifies | 1989 | PODS |