NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems
Summary: NBTree is a lock-free, PM-friendly B+-Tree for eADR-enabled PM systems. Leaf metadata in DRAM; four SMO techniques; shift-aware inner-node search; log-structured inserts; 11x throughput, 43x tail-latency gains vs. prior persistent B+-Trees. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Bowen Zhang
- 2. Shengan Zheng
- 3. Zhenlin Qi
- 4. Linpeng Huang
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,226 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD | 5.1413982e-05 |
| 7,152 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB | 4.8126591e-05 |
| 8,990 | The Past, Present and Future of Indexing on Persistent Memory | 2022 | VLDB | 4.4115395e-05 |
| 9,370 | FluidKV: Seamlessly Bridging the Gap between Indexing Performance and Memory-Footprint on Ultra-Fast Storage | 2024 | VLDB | 4.3461752e-05 |
| 10,151 | DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory | 2026 | SIGMOD | 4.1905499e-05 |
| 10,257 | SIDLE: Tree-structure Aware Indexes for CXL-based Heterogeneous Memory | 2026 | VLDB | 4.1905499e-05 |
| 10,788 | From Scale-Up to Scale-Out: PolarDB's Journey to Achieving 2 Billion tpmC | 2025 | VLDB | 4.1905499e-05 |
| 11,012 | Sorting on Byte-Addressable Storage: The Resurgence of Tree Structure | 2024 | VLDB | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 643 | FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory | 2016 | SIGMOD | 0.00018733394 |
| 809 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00016409797 |
| 1,306 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB | 0.00012674725 |
| 2,508 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB | 8.6251065e-05 |
| 2,986 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB | 7.7757727e-05 |
| 3,341 | Evaluating Persistent Memory Range Indexes | 2020 | VLDB | 7.1984492e-05 |
| 4,073 | Understanding the Idiosyncrasies of Real Persistent Memory | 2021 | VLDB | 6.4717052e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,092 | Revisiting the Design of LSM-tree Based OLTP Storage Engine with Persistent Memory | 2021 | VLDB | 4.83025e-05 |
| 3,341 | Evaluating Persistent Memory Range Indexes | 2020 | VLDB | 7.1984492e-05 |
| 6,226 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD | 5.1413982e-05 |
| 643 | FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory | 2016 | SIGMOD | 0.00018733394 |
| 10,571 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 4.1905499e-05 |
| 2,508 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB | 8.6251065e-05 |
| 7,480 | Buffered Persistence in B+ Trees | 2024 | SIGMOD | 4.7135369e-05 |
| 2,986 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB | 7.7757727e-05 |
| 1,306 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB | 0.00012674725 |
| 809 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00016409797 |