DBScholar

Back to papers

FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update

Summary: FB+-tree hybridizes B+-trees and tries by using multi-byte common-prefix “features” for cache-friendly branching while preserving balance and scan efficiency. A link/optimistic-lock protocol enables latch-free updates, delivering up to 3.7× higher throughput than popular B+-trees under contention. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h18bae1a94336950d
Venue
VLDB
Year
2025
Pagerank
4.9769913e-05
Overall Rank
11,245 | 24.43%
DOI
10.14778/3725688.3725691
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{chen_vldb25,
        title = {{FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update}},
        author = {Chen, Yuan and Li, Ao and Li, Wenhai and Deng, Lingfeng},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {6},
        pages = {1579--1592},
        doi = {10.14778/3725688.3725691},
        url = {https://doi.org/10.14778/3725688.3725691},
        year = {2025}
}

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 28 of 28 cited papers.

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

Rank Cited Paper Year Venue Pagerank
40 The Case for Learned Index Structures 2018 SIGMOD 0.00046363107
68 Making B+-Trees Cache Conscious in Main Memory 2000 SIGMOD 0.00037957995
206 Cache Conscious Indexing for Decision-Support in Main Memory 1999 VLDB 0.00024981343
229 A Study of Index Structures for Main Memory Database Management Systems 1986 VLDB 0.00023915204
277 FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs 2010 SIGMOD 0.00022320139
422 ALEX: An Updatable Adaptive Learned Index 2020 SIGMOD 0.00018488849
502 FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory 2016 SIGMOD 0.00017250394
547 Improving Index Performance through Prefetching 2001 SIGMOD 0.00016575635
904 HOT: A Height Optimized Trie Index for Main-Memory Database Systems 2018 SIGMOD 0.00013170142
960 Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes 2016 SIGMOD 0.0001283613
1,075 Cache-Oblivious String B-trees 2006 PODS 0.00012157749
1,316 Building a Bw-Tree Takes More Than Just Buzz Words 2018 SIGMOD 0.00011046804
1,586 Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance 2002 SIGMOD 0.00010143882
1,716 Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems 2001 VLDB 9.8041694e-05
1,839 Main-Memory Index Structures with Fixed-Size Partial Keys 2001 SIGMOD 9.5284548e-05
1,856 LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory 2020 VLDB 9.4960518e-05
1,857 PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors 2011 VLDB 9.4935317e-05
2,861 APEX: A High-Performance Learned Index on Persistent Memory 2022 VLDB 7.9295281e-05
2,908 AI Meets Database: AI4DB and DB4AI 2021 SIGMOD 7.8716173e-05
3,374 A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms 2016 SIGMOD 7.3606793e-05
4,878 Oasis: An Optimal Disjoint Segmented Learned Range Filter 2024 VLDB 6.369385e-05
5,700 PilotScope: Steering Databases with Machine Learning Drivers 2024 VLDB 6.028998e-05
6,613 Making In-Memory Learned Indexes Efficient on Disk 2024 SIGMOD 5.7326443e-05
6,867 Accelerating String-key Learned Index Structures via Memoization-based Incremental Training 2024 VLDB 5.6581046e-05
7,082 LITS: An Optimized Learned Index for Strings 2024 VLDB 5.6010119e-05
7,297 Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction 2024 SIGMOD 5.5609237e-05
8,649 OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes 2023 SIGMOD 5.2932376e-05
10,204 Performance Guarantees for B-trees with Different-Sized Atomic Keys 2010 PODS 5.0599411e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 277 FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs 2010 SIGMOD
2 11,240 Efficient Concurrent Updates to Persistent Randomized Binary Search Trees 2025 VLDB
3 1,839 Main-Memory Index Structures with Fixed-Size Partial Keys 2001 SIGMOD
4 6,065 NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems 2022 VLDB
5 966 BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory 2018 VLDB
6 7,029 BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees 2023 VLDB
7 502 FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory 2016 SIGMOD
8 547 Improving Index Performance through Prefetching 2001 SIGMOD
9 6,486 Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index 2024 VLDB
10 1,586 Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance 2002 SIGMOD