HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs
ACM Transactions on Architecture and Code Optimization · 30.06.2026 · 23 (2) · 1-26
DOI: 10.1145/3817051 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Architecture and Code Optimization, online erschienen am 25.06.2026. Verfasst von Kai Lu und 7 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Special High-Quality Program of MIIT.
Abstract (Originalsprache)
Key-value (KV) separation has emerged as a pivotal solution to tackle write amplification in LSM-tree-based KV stores (LSM stores). However, the garbage collection (GC) mechanism essential for reclaiming obsolete values introduces substantial overheads: (i) Additional LSM-tree I/O operations degrade foreground performance and cause data inconsistency issues; (ii) Exacerbated write amplification arises from excessive valid data migration in update-intensive workloads. Moreover, existing GC optimization schemes fundamentally struggle to balance space overhead, write amplification, and system performance. In this article, we propose HeapKV, a high-performance KV-separated LSM store that improves GC efficiency through three key technologies: (i) A lightweight two-level index and a global garbage view decouple GC operations of value storage from the LSM-tree, eliminating additional I/O operations; (ii) A novel valid data migration scheme mitigates write amplification during space reclamation by in-place overwrites and logical data copying; (iii) SSD-conscious I/O optimizations featuring asynchronous value flushing, fast read paths and concurrent prefetching for range queries. Extensive experiments demonstrate that HeapKV achieves 40%–7.4× higher throughput under diverse workloads with lower write/space amplification, compared to other state-of-the-art KV-separated LSM stores.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of China
- Special High-Quality Program of MIIT
- Shandong Provincial Natural Science Foundation
- China Postdoctoral Science Foundation
- Postdoctor Project of Hubei Province
Zitieren
APA
Lu, K., Zhou, Y., Wang, N., Wan, J., Huang, B., Zhang, Y., Zhang, J., & Dong, Y. (2026). HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs. ACM Transactions on Architecture and Code Optimization, 23(2), 1-26. https://doi.org/10.1145/3817051
Vancouver
Lu K, Zhou Y, Wang N, Wan J, Huang B, Zhang Y, et al. HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs. ACM Transactions on Architecture and Code Optimization. 2026;23(2):1-26. doi:10.1145/3817051
BibTeX
@article{Lu2026,
author = {Lu, Kai and Zhou, Yuanhui and Wang, Nengjie and Wan, Jiguang and Huang, Bisheng and Zhang, Yang and Zhang, Jinpeng and Dong, Yu},
title = {HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs},
journal = {ACM Transactions on Architecture and Code Optimization},
year = {2026},
volume = {23},
number = {2},
pages = {1--26},
doi = {10.1145/3817051}
}
EUVIMED