Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives
Summary: Per-page logging B+-tree splits the monolithic log into many static 4KB per-page logs on computational storage drives with transparent compression, creating overprovisioned, highly-compressible log space to accelerate small-write operations. Recovery skips per-page log scans so latency is independent of total log size; prototype yields up to 625% higher throughput, 19.2 ms recovery, and 0.5–1.6% storage overhead. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kecheng Huang (Chinese University of Hong Kong)
- 2. Zhaoyan Shen (Shandong University)
- 3. Zili Shao (Chinese University of Hong Kong)
- 4. Tong Zhang (Rensselaer Polytechnic Institute; ScaleFlux Inc.)
- 5. Feng Chen (Louisiana State University)
BibTeX Citation
@article{huang_vldb24,
title = {{Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives}},
author = {Huang, Kecheng and Shen, Zhaoyan and Shao, Zili and Zhang, Tong and Chen, Feng},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {2},
pages = {134--147},
doi = {10.14778/3626292.3626297},
url = {https://doi.org/10.14778/3626292.3626297},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 24 of 24 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,036 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |
| 2 | 6,742 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |
| 3 | 5,120 | Multi-Disk B-trees | 1991 | SIGMOD |
| 4 | 9,518 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD |
| 5 | 6,396 | Contention and Space Management in B-Trees | 2021 | CIDR |
| 6 | 2,968 | On-line Reorganization of Sparsely-populated B+-trees | 1996 | SIGMOD |
| 7 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |
| 8 | 7,906 | Buffered Persistence in B+ Trees | 2024 | SIGMOD |
| 9 | 1,731 | Write-Optimized B-Trees | 2004 | VLDB |
| 10 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |