SA-LSM : Optimize Data Layout for LSM-tree Based Storage using Survival Analysis
Teng Zhang, Jian Tan, Xin Cai, Jianying Wang, Feifei Li, Jianling Sun
Abstract
A significant fraction of data in cloud storage is rarely accessed, referred to as cold data. Accurately identifying and efficiently managing cold data on cost-effective storages is one of the major challenges for cloud providers, which balances between reducing the cost and improving the system performance. To this end, we propose SA-LSM to use (S)urvival (A)nalysis for Log-Structure Merge Tree (LSM-tree) key-value (KV) stores. Conventionally, the data layout of LSM-tree is determined jointly by the write and the compaction operations. However, this process by default does not fully utilize the access information of data records, leading to a suboptimal data layout that negatively impacts the system performance. SA-LSM utilizes the survival analysis, a statistical learning algorithm commonly used in biostatistics, to optimize the data layout. When put into perspective of LSM-tree with proper adoptions, SA-LSM can accurately predict cold data using the historical semantic information and access traces. As a concrete realization, we implement our proposal in X-Engine, a commercial-strength opensource LSM-tree storage engine. To make the deployment more flexible, we also design a non-intrusive architecture that offloads CPU-intensive work, e.g., model training and inference, to an external service. Extensive experiments on real-world workloads show that it can decrease the tail latency by up to 78.9% compared to the state-of-the-art techniques. The generality of this approach and the significant performance improvement show great potentials in a variety of related applications.
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.
Cited by top-tier papers4
- Calcspar: A Contract-Aware LSM Store for Cloud Storage with Low Latency SpikesYuanhui Zhou, Jian Zhou, Shuning Chen, Peng Xu et al.USENIX ATC 2023 · 12 citations
- Aster: Enhancing LSM-structures for Scalable Graph DatabaseDingheng Mo, Junfeng Liu, Fan Wang, Siqiang LuoSIGMOD 2025 · 10 citations
- 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
- HotRAP: Hot Record Retention and Promotion for LSM-trees with Tiered StorageJiansheng Qiu, Fangzhou Yuan, Mingyu Gao, Huanchen ZhangUSENIX ATC 2025 · 3 citations
Builds on6
- Learning Relaxed Belady for Content Distribution Network CachingZhenyu Song, Daniel S. Berger, Kai Li, Wyatt LloydNSDI 2020 · 193 citations
- An Imitation Learning Approach for Cache ReplacementEvan Zheran Liu, Milad Hashemi, Kevin Swersky, Parthasarathy Ranganathan et al.ICML 2020 · 108 citations
- FPGA-Accelerated Compactions for LSM-based Key-Value StoreTeng Zhang, Jianying Wang, Xuntao Cheng, Hao Xu et al.FAST 2020 · 99 citations
- AC-Key: Adaptive Caching for LSM-based Key-Value StoresFenggang Wu, Ming-Hong Yang, Baoquan Zhang, David H. C. DuUSENIX ATC 2020 · 81 citations
- Automating Distributed Tiered Storage Management in Cluster ComputingHerodotos Herodotou, Elena KakoulliVLDB 2020 · 30 citations
Related papers
- Leaper: A Learned Prefetcher for Cache Invalidation in LSM-tree based Storage EnginesLei Yang, Hong Wu, Tieying Zhang, Xuntao Cheng et al.VLDB 2020
- Real-Time LSM-Trees for HTAP WorkloadsHemant Saxena, Lukasz Golab, Stratos Idreos, Ihab F. IlyasICDE 2023 · 8 citations
- LeaderKV: Improving Read Performance of KV Stores via Learned Index and Decoupled KV TableYi Wang, Jianan Yuan, Shangyu Wu, Huan Liu et al.ICDE 2024 · 12 citations
- CAMAL: Optimizing LSM-trees via Active LearningWeiping Yu, Siqiang Luo, Zihao Yu, Gao CongSIGMOD 2025 · 11 citations
- Lethe: A Tunable Delete-Aware LSM EngineSubhadeep Sarkar, Tarikul Islam Papon, Dimitris Staratzis, Manos AthanassoulisSIGMOD 2020 · 68 citations
