Buffered Persistence in B+ Trees
Summary: BD+Tree: buffered, epoch-based B+ tree for NVM; crash recovers to e-2; delayed, aggregated writes boost locality. Relaxed persistence reduces NVM traffic; up to 2.4x throughput; writes drop up to 99% on locality workloads; gains scale with cache. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mingzhe Du (University of Rochester)
- 2. Michael L. Scott (University of Rochester)
BibTeX Citation
@inproceedings{du_sigmod24,
title = {{Buffered Persistence in B+ Trees}},
author = {Du, Mingzhe and Scott, Michael L.},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3698801},
url = {https://dl.acm.org/doi/10.1145/3698801},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,357 | DepCache: A KV Cache Management Framework for GraphRAG with Dependency Attention | 2026 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00015695264 |
| 1,823 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB | 9.6739945e-05 |
| 2,246 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB | 8.8734154e-05 |
| 2,738 | Utilization of B-trees with Inserts, Deletes and Modifies | 1989 | PODS | 8.1875737e-05 |
| 3,526 | Understanding the Idiosyncrasies of Real Persistent Memory | 2021 | VLDB | 7.3429293e-05 |
| 3,647 | Maximizing Persistent Memory Bandwidth Utilization for OLAP Workloads | 2021 | SIGMOD | 7.2271935e-05 |
| 5,954 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD | 6.0292226e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,025 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS |
| 2 | 6,126 | Efficient Bulk Updates on Multiversion B-trees | 2013 | VLDB |
| 3 | 1,567 | Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance | 2002 | SIGMOD |
| 4 | 948 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB |
| 5 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 6 | 6,742 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |
| 7 | 11,218 | Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives | 2024 | VLDB |
| 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 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |