Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index

Summary: Bf-Tree decouples cache pages from 4-KB disk pages, using variable-length mini-pages for record-level caching, buffered updates, and range-gap caching in a concurrent larger-than-memory B-Tree. Outperforms RocksDB and conventional B-Trees on scans, writes, and point lookups. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h141d738e7cd1c508
Venue: VLDB
Year: 2024
Pagerank: 5.766886e-05
Overall Rank: 6,486 | 56.41%
DOI: 10.14778/3681954.3682012
PDF: Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

1. Xiangpeng Hao (University of Wisconsin)
2. Badrish Chandramouli (Microsoft)

BibTeX Citation

@article{hao_vldb24,
        title = {{Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index}},
        author = {Hao, Xiangpeng and Chandramouli, Badrish},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {11},
        pages = {3442--3455},
        doi = {10.14778/3681954.3682012},
        url = {https://doi.org/10.14778/3681954.3682012},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,647	Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees	2025	SIGMOD	5.2947307e-05
9,732	Tabular: Efficiently Building Efficient Indexes	2025	VLDB	5.1325223e-05
10,580	Focus! Fast On-disk Concurrency-control Using Sketches	2026	SIGMOD	4.9769913e-05
10,663	Improving Range Scan Performance in LSM-trees with Group Caching	2026	SIGMOD	4.9769913e-05
10,680	Predictive Translation: High-Performance Buffer Management Without the Trade-Offs	2026	SIGMOD	4.9769913e-05
10,735	How to Write to SSDs	2026	VLDB	4.9769913e-05
10,768	Dynamic read & write optimization with TurtleKV	2026	VLDB	4.9769913e-05
11,143	TXSQL: Lock Optimizations Towards High Contented Workloads	2025	SIGMOD	4.9769913e-05

Outgoing Citations (Sorted by Pagerank)

Showing 30 of 30 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
63	Amazon Aurora: Design Considerations for High Throughput Cloud-Native Relational Databases	2017	SIGMOD	0.00038521221
234	TiDB: A Raft-based HTAP Database	2020	VLDB	0.00023756332
546	Faster: A Concurrent Key-Value Store with In-Place Updates	2018	SIGMOD	0.00016584272
635	ERMIA: Fast Memory-Optimized Database System for Heterogeneous Workloads	2016	SIGMOD	0.00015362118
729	Anti-Caching: A New Approach to Database Management System Architecture	2013	VLDB	0.00014417679
966	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.00012806678
1,316	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	0.00011046804
1,524	Trekking Through Siberia: Managing Cold Data in a Memory-Optimized Database	2014	VLDB	0.0001036095
1,966	Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory	2022	SIGMOD	9.3014925e-05
1,982	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.2570284e-05
2,742	Evaluating Persistent Memory Range Indexes	2020	VLDB	8.0645378e-05
2,861	APEX: A High-Performance Learned Index on Persistent Memory	2022	VLDB	7.9295281e-05
2,921	What Modern NVMe Storage Can Do, And How To Exploit It: High-Performance I/O for High-Performance Storage Engines	2023	VLDB	7.8503064e-05
3,233	TreeLine: An Update-In-Place Key-Value Store for Modern Storage	2023	VLDB	7.5008192e-05
4,635	PLIN: A Persistent Learned Index for Non-Volatile Memory with High Performance and Instant Recovery	2023	VLDB	6.4904555e-05
4,760	SQLite: Past, Present, and Future	2022	VLDB	6.4288554e-05
5,022	Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems	2021	VLDB	6.309271e-05
5,161	Are You Sure You Want to Use MMAP in Your Database Management System?	2022	CIDR	6.2452792e-05
5,899	HydraList: A Scalable In-Memory Index Using Asynchronous Updates and Partial Replication	2020	VLDB	5.9521778e-05
6,065	NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems	2022	VLDB	5.8953182e-05
6,074	Halo: A Hybrid PMem-DRAM Persistent Hash Index with Fast Recovery	2022	SIGMOD	5.8926486e-05
6,828	PIM-tree: A Skew-resistant Index for Processing-in-Memory	2023	VLDB	5.6690684e-05
6,990	FASTER: An Embedded Concurrent Key-Value Store for State Management	2018	VLDB	5.6256457e-05
7,029	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB	5.6152961e-05
7,498	B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases	2023	VLDB	5.5078165e-05
8,075	Two is Better Than One: The Case for 2-Tree for Skewed Data Sets	2023	CIDR	5.3921263e-05
8,247	Pea Hash: A Performant Extendible Adaptive Hashing Index	2023	SIGMOD	5.3678887e-05
8,419	Towards Buffer Management with Tiered Main Memory	2024	SIGMOD	5.3328741e-05
9,003	Hamming Tree: The Case for Energy-Aware Indexing for NVMs	2023	SIGMOD	5.2393165e-05
10,075	WALTZ: Leveraging Zone Append to Tighten the Tail Latency of LSM Tree on ZNS SSD	2023	VLDB	5.0837855e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	258	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD
2	8,082	Buffered Persistence in B+ Trees	2024	SIGMOD
3	547	Improving Index Performance through Prefetching	2001	SIGMOD
4	1,586	Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance	2002	SIGMOD
5	1,757	Write-Optimized B-Trees	2004	VLDB
6	966	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB
7	9,559	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD
8	1,506	BF-Tree: Approximate Tree Indexing	2014	VLDB
9	11,245	FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update	2025	VLDB
10	7,029	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB