DumpKV: Learning based lifetime aware garbage collection for key value separation in LSM-tree
Zhutao Zhuang, Zhiguang Chen, Xinqi Zeng
Abstract
Key-value separation is used in LSM-tree to stored large value in separate log files to reduce write amplification, but requires garbage collection to garbage collect invalid values. Existing garbage collection techniques in LSM-tree typically adopt static parameter based garbage collection to garbage collect obsolete values which struggles to achieve low write amplification and it's challenging to find proper parameter for garbage collection triggering. In this work we introduce DumpKV, which introduces learning based lifetime aware garbage collection with dynamic lifetime adjustment to do efficient garbage collection to achieve lower write amplification. DumpKV manages large values using trained lightweight model with features suitable for various application based on past write access information of keys to give lifetime prediction for each individual key to enable efficient garbage collection. To reduce interference to write throughput DumpKV conducts feature collection during L0-L1 compaction leveraging the fact that LSM-tree is small under KV separation . Experimental results show that DumpKV achieves lower write amplification by 38%-73% compared to existing keyvalue separation garbage collection LSM-tree stores with small feature storage overhead.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7ad072d5-c3a5-46ff-8834-5f14ab7b11f7Cited by top-tier papers1
Ask how each one uses itBuilds on15
- ALEX: An Updatable Adaptive Learned IndexJialin Ding, Umar Farooq Minhas, Jia Yu, Chi Wang et al.SIGMOD 2020 · 274 citations
- Learning Relaxed Belady for Content Distribution Network CachingZhenyu Song, Daniel S. Berger, Kai Li, Wyatt LloydNSDI 2020 · 193 citations
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with Matrix Container in NVMTing Yao, Yiwen Zhang, Jiguang Wan, Qiu Cui et al.USENIX ATC 2020 · 186 citations
- LinnOS: Predictability on Unpredictable Flash Storage with a Light Neural NetworkMingzhe Hao, Levent Toksoz, Nanqinqin Li, Edward Edberg Halim et al.OSDI 2020 · 97 citations
- Fast RDMA-based Ordered Key-Value Store using Remote Learned CacheXingda Wei, Rong Chen, Haibo ChenOSDI 2020 · 93 citations
Related papers
- Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-treesJianshun Zhang, Fang Wang, Sheng Qiu, Yi Wang et al.ICDE 2024 · 5 citations
- gParaKV: A GPGPU-accelerated Key-Value Separation-based KV Store with Optimized Compaction and Garbage CollectionHui Sun, Xiangxiang Jiang, Xiao Qin, Song Jiang et al.SC 2025 · 3 citations
- Differentiated Key-Value Storage Management for Balanced I/O PerformanceYongkun Li, Zhen Liu, Patrick P. C. Lee, Jiayu Wu et al.USENIX ATC 2021 · 79 citations
- Terark-DS: A High-Performance and Storage-Efficient Key-Value Separation Storage Engine on Disaggregated StorageJianshun Zhang, Xun Deng, Fang Wang, Jiaxin Ou et al.VLDB 2026
- AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC OffloadingZhuohui Duan, Hao Feng, Haikun Liu, Xiaofei Liao et al.FAST 2025 · 11 citations
