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: 13742
Venue: VLDB
Year: 2024
Pagerank: 5.7862414e-05
Overall Rank: 6,742 | 53.75%
DOI: 10.14778/3681954.3682012

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 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,475	Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees	2025	SIGMOD	5.4171036e-05
9,547	Tabular: Efficiently Building Efficient Indexes	2025	VLDB	5.2528121e-05
10,371	Focus! Fast On-disk Concurrency-control Using Sketches	2026	SIGMOD	5.093636e-05
10,465	Improving Range Scan Performance in LSM-trees with Group Caching	2026	SIGMOD	5.093636e-05
10,482	Predictive Translation: High-Performance Buffer Management Without the Trade-Offs	2026	SIGMOD	5.093636e-05
10,543	How to Write to SSDs	2026	VLDB	5.093636e-05
10,700	TXSQL: Lock Optimizations Towards High Contented Workloads	2025	SIGMOD	5.093636e-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
73	Amazon Aurora: Design Considerations for High Throughput Cloud-Native Relational Databases	2017	SIGMOD	0.00037333356
271	TiDB: A Raft-based HTAP Database	2020	VLDB	0.00022703024
614	Faster: A Concurrent Key-Value Store with In-Place Updates	2018	SIGMOD	0.00015720975
655	ERMIA: Fast Memory-Optimized Database System for Heterogeneous Workloads	2016	SIGMOD	0.00015263509
720	Anti-Caching: A New Approach to Database Management System Architecture	2013	VLDB	0.00014632914
948	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.0001303916
1,390	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	0.00010942775
1,524	Trekking Through Siberia: Managing Cold Data in a Memory-Optimized Database	2014	VLDB	0.00010501517
1,954	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.4208165e-05
2,212	Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory	2022	SIGMOD	8.9411432e-05
2,707	Evaluating Persistent Memory Range Indexes	2020	VLDB	8.2279594e-05
2,910	APEX: A High-Performance Learned Index on Persistent Memory	2022	VLDB	7.9700885e-05
3,001	What Modern NVMe Storage Can Do, And How To Exploit It: High-Performance I/O for High-Performance Storage Engines	2023	VLDB	7.8673493e-05
3,535	TreeLine: An Update-In-Place Key-Value Store for Modern Storage	2023	VLDB	7.3333933e-05
4,578	PLIN: A Persistent Learned Index for Non-Volatile Memory with High Performance and Instant Recovery	2023	VLDB	6.6210545e-05
5,226	Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems	2021	VLDB	6.3090383e-05
5,284	SQLite: Past, Present, and Future	2022	VLDB	6.2827906e-05
5,823	HydraList: A Scalable In-Memory Index Using Asynchronous Updates and Partial Replication	2020	VLDB	6.0752299e-05
5,989	Are You Sure You Want to Use MMAP in Your Database Management System?	2022	CIDR	6.0175059e-05
5,993	NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems	2022	VLDB	6.0158662e-05
6,397	Halo: A Hybrid PMem-DRAM Persistent Hash Index with Fast Recovery	2022	SIGMOD	5.8869998e-05
6,710	PIM-tree: A Skew-resistant Index for Processing-in-Memory	2023	VLDB	5.796491e-05
7,189	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB	5.6775326e-05
7,437	FASTER: An Embedded Concurrent Key-Value Store for State Management	2018	VLDB	5.6191179e-05
8,016	Two is Better Than One: The Case for 2-Tree for Skewed Data Sets	2023	CIDR	5.5070057e-05
8,082	Pea Hash: A Performant Extendible Adaptive Hashing Index	2023	SIGMOD	5.4915503e-05
8,255	B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases	2023	VLDB	5.4574671e-05
8,357	Towards Buffer Management with Tiered Main Memory	2024	SIGMOD	5.4446759e-05
8,833	Hamming Tree: The Case for Energy-Aware Indexing for NVMs	2023	SIGMOD	5.3599647e-05
9,886	WALTZ: Leveraging Zone Append to Tighten the Tail Latency of LSM Tree on ZNS SSD	2023	VLDB	5.2007886e-05

Semantically Similar Papers

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