Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index
Summary: Introduces Bf-Tree, a concurrent, read-write-optimized B-Tree variant for larger-than-memory range indexing that decouples cache pages from disk pages and uses variable-length in-memory mini-pages. A mini-page buffer pool enables record-level caching, update buffering and gap caching, yielding substantial gains vs RocksDB/standard B-Trees (2–6×) across scans, writes, and point lookups. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,529 | Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees | 2025 | SIGMOD | 4.32934e-05 |
| 10,080 | Focus! Fast On-disk Concurrency-control Using Sketches | 2026 | SIGMOD | 4.1945683e-05 |
| 10,176 | Improving Range Scan Performance in LSM-trees with Group Caching | 2026 | SIGMOD | 4.1945683e-05 |
| 10,193 | Predictive Translation: High-Performance Buffer Management Without the Trade-Offs | 2026 | SIGMOD | 4.1945683e-05 |
| 10,255 | How to Write to SSDs | 2026 | VLDB | 4.1945683e-05 |
| 10,418 | TXSQL: Lock Optimizations Towards High Contented Workloads | 2025 | SIGMOD | 4.1945683e-05 |
| 10,583 | Tabular: Efficiently Building Efficient Indexes | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 379 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.0002493527 |
| 7,481 | Buffered Persistence in B+ Trees | 2024 | SIGMOD | 4.7180617e-05 |
| 531 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00020790058 |
| 1,659 | Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance | 2002 | SIGMOD | 0.00010980701 |
| 1,480 | Write-Optimized B-Trees | 2004 | VLDB | 0.00011746722 |
| 1,405 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB | 0.00012174592 |
| 10,368 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1945683e-05 |
| 1,913 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010113937 |
| 10,562 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 4.1945683e-05 |
| 7,995 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB | 4.6109825e-05 |