AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading
Zhuohui Duan, Hao Feng, Haikun Liu, Xiaofei Liao, Hai Jin, Bangyu Li
Abstract
The key-value separation is renowned for its significant mitigation of the write amplification inherent in traditional LSM trees. However, KV separation potentially increases performance overhead in the management of Value region, especially for garbage collection (GC) operation that is used to reduce the redundant space occupation. In response, many efforts have been made to optimize the GC mechanism for KV separation. However, our analysis indicates that such solution based on trade-offs between CPU and I/O overheads cannot simultaneously satisfy the three requirements of KV separated systems in terms of throughput, tail latency, and space usage. This limitation hinders their real-world application.
In this paper, we introduce AegonKV, a "three-birds-onestone" solution that comprehensively enhances the throughput, tail latency, and space usage of KV separated systems. AegonKV first proposes a SmartSSD-based GC offloading mechanism to enable asynchronous GC operations without competing with LSM read/write for bandwidth or CPU. Ae-gonKV leverages offload-friendly data structures and hardware/software execution logic to address the challenges of GC offloading. Experiments demonstrate that AegonKV achieves the largest throughput improvement of 1.28-3.3 times, a significant reduction of 37%-66% in tail latency, and 15%-85% in space overhead compared to existing KV separated systems.
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 2e842db8-ddd2-47a9-9386-9311b068c21bCited by top-tier papers2
- Discard-Based Garbage Collection for Distributed Log-Structured Storage Systems in ByteDanceRunhua Bian, Liqiang Zhang, Jinxin Liu, Jiacheng Zhang et al.FAST 2026
- 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
Builds on9
- A large scale analysis of hundreds of in-memory cache clusters at TwitterJuncheng Yang, Yao Yue, K. V. RashmiOSDI 2020 · 245 citations
- POLARDB Meets Computational Storage: Efficiently Support Analytical Workloads in Cloud-Native Relational DatabaseWei Cao, Yang Liu, Zhushi Cheng, Ning Zheng et al.FAST 2020 · 140 citations
- FPGA-Accelerated Compactions for LSM-based Key-Value StoreTeng Zhang, Jianying Wang, Xuntao Cheng, Hao Xu et al.FAST 2020 · 99 citations
- PinK: High-speed In-storage Key-value Store with Bounded TailsJunsu Im, Jinwook Bae, Chanwoo Chung, Arvind et al.USENIX ATC 2020 · 85 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
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
- DumpKV: Learning based lifetime aware garbage collection for key value separation in LSM-treeZhutao Zhuang, Zhiguang Chen, Xinqi ZengVLDB 2025 · 3 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
- O3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer OffloadingQi Lin, Gangqi Huang, Te Guo, Chang Guo et al.SIGMOD 2026 · 2 citations
- KV-SSD: What Is It Good For?Manoj Pravakar Saha, Adnan Maruf, Bryan S. Kim, Janki BhimaniDAC 2021 · 4 citations
