Database Paper Browser

Back to papers

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

Summary: FB+-tree: a memory-optimized B+-tree that uses progressive multi-byte “features” after common prefixes, blurring B+-tree and trie behavior to exploit prefix skew while preserving balance and range-scan locality. A sync scheme combining link technique, optimistic locks, and small atomics enables latch-free updates; matches trie lookup speed and outperforms popular B+-trees 2.3–3.7× at 96 threads, with strong update/scan performance under contention. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13820
Venue
VLDB
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,562 | 26.53%
DOI
10.14778/3725688.3725691

Incoming Non-self Citations Over Time

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

Authors

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
102 The Case for Learned Index Structures 2018 SIGMOD 0.00049545203
103 Making B+-Trees Cache Conscious in Main Memory 2000 SIGMOD 0.00049150032
233 A Study of Index Structures for Main Memory Database Management Systems 1986 VLDB 0.00032021526
238 Cache Conscious Indexing for Decision-Support in Main Memory 1999 VLDB 0.00031642425
381 FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs 2010 SIGMOD 0.00024873637
531 Improving Index Performance through Prefetching 2001 SIGMOD 0.00020790058
680 FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory 2016 SIGMOD 0.0001821501
826 ALEX: An Updatable Adaptive Learned Index 2020 SIGMOD 0.00016224841
1,087 HOT: A Height Optimized Trie Index for Main-Memory Database Systems 2018 SIGMOD 0.00014162909
1,117 Cache-Oblivious String B-trees 2006 PODS 0.00013882205
1,312 Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes 2016 SIGMOD 0.00012652548
1,659 Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance 2002 SIGMOD 0.00010980701
1,809 Main-Memory Index Structures with Fixed-Size Partial Keys 2001 SIGMOD 0.00010483957
2,006 PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors 2011 VLDB 9.8101551e-05
2,244 Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems 2001 VLDB 9.2097912e-05
2,394 Building a Bw-Tree Takes More Than Just Buzz Words 2018 SIGMOD 8.9001843e-05
2,510 LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory 2020 VLDB 8.6204284e-05
3,473 AI Meets Database: AI4DB and DB4AI 2021 SIGMOD 7.062864e-05
3,777 A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms 2016 SIGMOD 6.7750901e-05
4,084 APEX: A High-Performance Learned Index on Persistent Memory 2022 VLDB 6.4622113e-05
5,762 Oasis: An Optimal Disjoint Segmented Learned Range Filter 2024 VLDB 5.3377299e-05
6,885 PilotScope: Steering Databases with Machine Learning Drivers 2024 VLDB 4.895386e-05
7,390 Making In-Memory Learned Indexes Efficient on Disk 2024 SIGMOD 4.7431654e-05
7,894 LITS: An Optimized Learned Index for Strings 2024 VLDB 4.6240341e-05
8,076 Accelerating String-key Learned Index Structures via Memoization-based Incremental Training 2024 VLDB 4.5917398e-05
8,101 Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction 2024 SIGMOD 4.5854141e-05
9,454 OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes 2023 SIGMOD 4.3391522e-05
9,859 Performance Guarantees for B-trees with Different-Sized Atomic Keys 2010 PODS 4.269353e-05
Previous Page 1 / 1 Next

Semantically Similar Papers