Persistent B+-Trees in Non-Volatile Main Memory
Summary: Introduces write-atomic B+-Trees for NVMM, using indirect slots/bitmaps to avoid entry movement and enable node-level atomicity or redo-only logging. Cuts persistence overhead, delivering up to 27.1× faster updates than prior logging/shadowing designs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shimin Chen (Chinese Academy of Sciences)
- 2. Qin Jin (Renmin University of China)
BibTeX Citation
@article{chen_vldb15,
title = {{Persistent B+-Trees in Non-Volatile Main Memory}},
author = {Chen, Shimin and Jin, Qin},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {7},
pages = {786--797},
doi = {10.14778/2752939.2752949},
url = {https://doi.org/10.14778/2752939.2752949},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 41 of 41 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 38 | Hekaton: SQL Server’s Memory-Optimized OLTP Engine | 2013 | SIGMOD | 0.00047648573 |
| 67 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00038461275 |
| 545 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00016766463 |
| 658 | Rethinking Database Algorithms for Phase Change Memory | 2011 | CIDR | 0.0001523554 |
| 840 | Storage Management in the NVRAM Era | 2014 | VLDB | 0.00013683877 |
| 1,996 | Write-limited sorts and joins for persistent memory | 2014 | VLDB | 9.3396464e-05 |
| 2,092 | Integrating Reliable Memory in Databases | 1997 | VLDB | 9.185168e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,246 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB |
| 2 | 12,025 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS |
| 3 | 11,623 | Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing | 2021 | CIDR |
| 4 | 4,647 | Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems | 2017 | VLDB |
| 5 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 6 | 948 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB |
| 7 | 491 | FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory | 2016 | SIGMOD |
| 8 | 1,823 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB |
| 9 | 5,993 | NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems | 2022 | VLDB |
| 10 | 7,906 | Buffered Persistence in B+ Trees | 2024 | SIGMOD |