BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees
Summary: BP-tree breaks the B-tree point/range tradeoff by pairing small internal nodes with large leaves backed by a buffered partitioned array (BPA) that delays key ordering for cheap inserts. It preserves point throughput while delivering up to 30× faster large scans than Masstree. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Helen Xu (Lawrence Berkeley National Laboratory)
- 2. Amanda Li (Massachusetts Institute of Technology)
- 3. Brian Wheatman (Johns Hopkins University)
- 4. Manoj Marneni (University of Utah)
- 5. Prashant Pandey (University of Utah)
BibTeX Citation
@article{xu_vldb23,
title = {{BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees}},
author = {Xu, Helen and Li, Amanda and Wheatman, Brian and Marneni, Manoj and Pandey, Prashant},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {11},
pages = {2976--2989},
doi = {10.14778/3611479.3611502},
url = {https://doi.org/10.14778/3611479.3611502},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,486 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB | 5.766886e-05 |
| 9,295 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 5.2003819e-05 |
| 9,559 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 5.1577035e-05 |
| 9,732 | Tabular: Efficiently Building Efficient Indexes | 2025 | VLDB | 5.1325223e-05 |
| 9,873 | Zombie Hashing: Reanimating Tombstones in a Graveyard | 2025 | SIGMOD | 5.115241e-05 |
| 10,350 | Replace or Augment: Rethinking the Role of Learned Indexes in Relational Databases | 2027 | VLDB | 4.9769913e-05 |
| 10,440 | Concurrent Path-Copying Update to Tree Structures | 2026 | SIGMOD | 4.9769913e-05 |
| 10,626 | Aeris Filter: A Strongly and Monotonically Adaptive Range Filter | 2026 | SIGMOD | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 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 | 7,974 | Efficient B-tree Based Indexing for Cloud Data Processing | 2010 | VLDB |
| 2 | 1,839 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD |
| 3 | 5,662 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS |
| 4 | 11,240 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 5 | 12,326 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS |
| 6 | 2,065 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 7 | 11,245 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB |
| 8 | 547 | Improving Index Performance through Prefetching | 2001 | SIGMOD |
| 9 | 9,559 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 10 | 6,486 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |