LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory
Summary: Exploits 3DXPoint’s cache-line write behavior and 256B access granularity to redesign persistent B+-trees. Entry moving, logless NAW-based splits, and distributed headers reduce line writes, yielding up to 2.92× faster insertions. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jihang Liu (Chinese Academy of Sciences; University of Chinese Academy of Sciences)
- 2. Shimin Chen (Chinese Academy of Sciences; University of Chinese Academy of Sciences)
- 3. Lujun Wang (Alibaba)
BibTeX Citation
@article{liu_vldb20,
title = {{LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory}},
author = {Liu, Jihang and Chen, Shimin and Wang, Lujun},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {7},
pages = {1078--1090},
doi = {10.14778/3384345.3384355},
url = {https://doi.org/10.14778/3384345.3384355},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 27 of 27 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 |
|---|---|---|---|---|
| 67 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00038461275 |
| 491 | FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory | 2016 | SIGMOD | 0.00017575163 |
| 545 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00016766463 |
| 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00015695264 |
| 658 | Rethinking Database Algorithms for Phase Change Memory | 2011 | CIDR | 0.0001523554 |
| 948 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB | 0.0001303916 |
| 1,347 | X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing | 2019 | SIGMOD | 0.00011073571 |
| 2,738 | Utilization of B-trees with Inserts, Deletes and Modifies | 1989 | PODS | 8.1875737e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,578 | PLIN: A Persistent Learned Index for Non-Volatile Memory with High Performance and Instant Recovery | 2023 | VLDB |
| 2 | 1,813 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD |
| 3 | 7,189 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 4 | 5,954 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |
| 5 | 10,829 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB |
| 6 | 2,246 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB |
| 7 | 948 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB |
| 8 | 7,906 | Buffered Persistence in B+ Trees | 2024 | SIGMOD |
| 9 | 5,993 | NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems | 2022 | VLDB |
| 10 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |