Back to papers
TreeLine: An Update-In-Place Key-Value Store for Modern Storage
Summary: Shows NVMe SSDs' parallel random/sequential parity makes update-in-place KV stores viable and introduces TreeLine, an SSD-tailored update-in-place design. Combines record caching, page grouping, and insert forecasting to close the LSM-read gap and achieves ~2x point-workload and up to ~11x overall speedups vs RocksDB/LeanStore on YCSB.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13349
- Venue
- VLDB
- Year
- 2023
- Pagerank
- 6.1965873e-05
- Overall Rank
- 4,427 | 69.21%
- DOI
-
10.14778/3561261.3561270
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 24 of 24 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 5,762 |
Oasis: An Optimal Disjoint Segmented Learned Range Filter |
2024 |
VLDB |
5.3377299e-05 |
| 6,840 |
LeanStore: A High-Performance Storage Engine for NVMe SSDs |
2024 |
VLDB |
4.9109345e-05 |
| 7,154 |
Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index |
2024 |
VLDB |
4.815267e-05 |
| 7,620 |
Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads |
2023 |
SIGMOD |
4.693568e-05 |
| 7,990 |
Blueprinting the Cloud: Unifying and Automatically Optimizing Cloud Data Infrastructures with BRAD |
2024 |
VLDB |
4.6117441e-05 |
| 8,076 |
Accelerating String-key Learned Index Structures via Memoization-based Incremental Training |
2024 |
VLDB |
4.5917398e-05 |
| 8,183 |
Two is Better Than One: The Case for 2-Tree for Skewed Data Sets |
2023 |
CIDR |
4.5658208e-05 |
| 8,339 |
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice |
2025 |
SIGMOD |
4.5434069e-05 |
| 8,805 |
ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads |
2026 |
VLDB |
4.4466855e-05 |
| 9,071 |
Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space |
2024 |
SIGMOD |
4.4025274e-05 |
| 9,346 |
Can Learned Indexes be Built Efficiently? A Deep Dive into Sampling Trade-offs |
2024 |
SIGMOD |
4.3532026e-05 |
| 9,386 |
Rethinking The Compaction Policies in LSM-trees |
2025 |
SIGMOD |
4.3455975e-05 |
| 9,917 |
Check Out the Big Brain on BRAD: Simplifying Cloud Data Processing with Learned Automated Data Meshes |
2023 |
VLDB |
4.2561557e-05 |
| 10,038 |
Understanding Robustness Issues of Updatable Learned Indexes: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,063 |
Counting Is All You Need for Instant Tuple Discovery: Enabling Real-Time HTAP in Standalone DBMSs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,176 |
Improving Range Scan Performance in LSM-trees with Group Caching |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,193 |
Predictive Translation: High-Performance Buffer Management Without the Trade-Offs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,255 |
How to Write to SSDs |
2026 |
VLDB |
4.1945683e-05 |
| 10,257 |
SIDLE: Tree-structure Aware Indexes for CXL-based Heterogeneous Memory |
2026 |
VLDB |
4.1945683e-05 |
| 10,367 |
Aster: Enhancing LSM-structures for Scalable Graph Database |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,649 |
STsCache: An Efficient Semantic Caching Scheme for Time-series Data Workloads Based on Hybrid Storage |
2025 |
VLDB |
4.1945683e-05 |
| 10,773 |
From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads |
2025 |
VLDB |
4.1945683e-05 |
| 11,007 |
Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives |
2024 |
VLDB |
4.1945683e-05 |
| 11,009 |
Sorting on Byte-Addressable Storage: The Resurgence of Tree Structure |
2024 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,876 |
MirrorKV: An Efficient Key-Value Store on Hybrid Cloud Storage with Balanced Performance of Compaction and Querying |
2023 |
SIGMOD |
4.4304279e-05 |
| 10,176 |
Improving Range Scan Performance in LSM-trees with Group Caching |
2026 |
SIGMOD |
4.1945683e-05 |
| 7,343 |
LSM-Trees and B-Trees: The Best of Both Worlds |
2019 |
SIGMOD |
4.7568442e-05 |
| 6,460 |
Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDs |
2021 |
VLDB |
5.0554178e-05 |
| 10,255 |
How to Write to SSDs |
2026 |
VLDB |
4.1945683e-05 |
| 7,218 |
Breaking Down Memory Walls in LSM-based Storage Systems |
2020 |
SIGMOD |
4.7982543e-05 |
| 11,704 |
Splaying Log-Structured Merge-Trees |
2018 |
SIGMOD |
4.1945683e-05 |
| 6,840 |
LeanStore: A High-Performance Storage Engine for NVMe SSDs |
2024 |
VLDB |
4.9109345e-05 |
| 1,366 |
SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data |
2017 |
VLDB |
0.00012357685 |
| 10,191 |
PartitionKV: Redesigning LSM-tree KV Stores on NVMs with Adaptive Partitioning for Reducing Write Stalls and Amplification |
2026 |
SIGMOD |
4.1945683e-05 |