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
- 2. Zhaoyan Shen
- 3. Zili Shao
- 4. Tong Zhang
- 5. Feng Chen
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 | Pagerank |
|---|---|---|---|---|
| 12,843 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 4.1945683e-05 |
| 7,154 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB | 4.815267e-05 |
| 5,098 | Multi-Disk B-trees | 1991 | SIGMOD | 5.7007294e-05 |
| 9,404 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3441378e-05 |
| 8,049 | Contention and Space Management in B-Trees | 2021 | CIDR | 4.5973972e-05 |
| 1,982 | On-line Reorganization of Sparsely-populated B+-trees | 1996 | SIGMOD | 9.8662834e-05 |
| 819 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB | 0.00016298164 |
| 7,481 | Buffered Persistence in B+ Trees | 2024 | SIGMOD | 4.7180617e-05 |
| 1,480 | Write-Optimized B-Trees | 2004 | VLDB | 0.00011746722 |
| 10,368 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1945683e-05 |