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
13821
Venue
VLDB
Year
2025
Pagerank
4.1905499e-05
Overall Rank
10,571 | 26.54%
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
101 The Case for Learned Index Structures 2018 SIGMOD 0.00049778866
104 Making B+-Trees Cache Conscious in Main Memory 2000 SIGMOD 0.00049475932
235 A Study of Index Structures for Main Memory Database Management Systems 1986 VLDB 0.00031980259
240 Cache Conscious Indexing for Decision-Support in Main Memory 1999 VLDB 0.00031526134
382 FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs 2010 SIGMOD 0.00024888997
622 Improving Index Performance through Prefetching 2001 SIGMOD 0.00018976783
643 FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory 2016 SIGMOD 0.00018733394
819 ALEX: An Updatable Adaptive Learned Index 2020 SIGMOD 0.00016237497
1,085 HOT: A Height Optimized Trie Index for Main-Memory Database Systems 2018 SIGMOD 0.00014173956
1,113 Cache-Oblivious String B-trees 2006 PODS 0.00013885755
1,300 Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes 2016 SIGMOD 0.00012711153
1,659 Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance 2002 SIGMOD 0.00010970279
1,807 Main-Memory Index Structures with Fixed-Size Partial Keys 2001 SIGMOD 0.0001047644
1,999 PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors 2011 VLDB 9.8287642e-05
2,233 Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems 2001 VLDB 9.2299873e-05
2,313 Building a Bw-Tree Takes More Than Just Buzz Words 2018 SIGMOD 9.0546844e-05
2,508 LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory 2020 VLDB 8.6251065e-05
3,466 AI Meets Database: AI4DB and DB4AI 2021 SIGMOD 7.0645718e-05
3,760 A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms 2016 SIGMOD 6.7790524e-05
3,945 APEX: A High-Performance Learned Index on Persistent Memory 2022 VLDB 6.605467e-05
5,769 Oasis: An Optimal Disjoint Segmented Learned Range Filter 2024 VLDB 5.3326049e-05
6,883 PilotScope: Steering Databases with Machine Learning Drivers 2024 VLDB 4.8918682e-05
7,389 Making In-Memory Learned Indexes Efficient on Disk 2024 SIGMOD 4.7386163e-05
7,894 LITS: An Optimized Learned Index for Strings 2024 VLDB 4.6196003e-05
8,079 Accelerating String-key Learned Index Structures via Memoization-based Incremental Training 2024 VLDB 4.5873372e-05
8,100 Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction 2024 SIGMOD 4.5821762e-05
8,595 OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes 2023 SIGMOD 4.4844188e-05
9,858 Performance Guarantees for B-trees with Different-Sized Atomic Keys 2010 PODS 4.2652623e-05
Previous Page 1 / 1 Next

Semantically Similar Papers