BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory
Summary: BzTree is a latch-free NVM-resident B-tree built around persistent multi-word CAS, simplifying concurrent updates while outperforming Bw-tree by up to 2×. Crash recovery requires only rolling back/forward in-flight operations (~145 μs), with one implementation spanning RAM and NVM. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Joy Arulraj (Carnegie Mellon University)
- 2. Justin Levandoski (Microsoft)
- 3. Umar Farooq Minhas (Microsoft)
- 4. Per-Ake Larson (University of Waterloo)
BibTeX Citation
@article{arulraj_vldb18,
title = {{BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory}},
author = {Arulraj, Joy and Levandoski, Justin and Minhas, Umar Farooq and Larson, Per-Ake},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {5},
pages = {553--565},
doi = {10.1145/3164135.3164147},
url = {https://doi.org/10.1145/3164135.3164147},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 37 of 37 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 35 | Hekaton: SQL Server’s Memory-Optimized OLTP Engine | 2013 | SIGMOD | 0.00047937476 |
| 504 | FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory | 2016 | SIGMOD | 0.00017195543 |
| 632 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00015366735 |
| 671 | Rethinking Database Algorithms for Phase Change Memory | 2011 | CIDR | 0.00014912266 |
| 1,085 | High Performance Transactions in Deuteronomy | 2015 | CIDR | 0.00012086316 |
| 3,010 | Instant Recovery for Main-Memory Databases | 2015 | CIDR | 7.7428329e-05 |
| 3,309 | To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing | 2015 | VLDB | 7.4176874e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,755 | Evaluating Persistent Memory Range Indexes | 2020 | VLDB |
| 2 | 7,049 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 3 | 11,980 | Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing | 2021 | CIDR |
| 4 | 1,863 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB |
| 5 | 6,500 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |
| 6 | 1,328 | Building a Bw-Tree Takes More Than Just Buzz Words | 2018 | SIGMOD |
| 7 | 11,301 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB |
| 8 | 3,309 | To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing | 2015 | VLDB |
| 9 | 632 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |
| 10 | 6,080 | NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems | 2022 | VLDB |