Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine
Subarna Chatterjee, Meena Jagadeesan, Wilson Qin, Stratos Idreos
Abstract
We present a self-designing key-value storage engine, Cosine, which can always take the shape of the close to "perfect" engine architecture given an input workload, a cloud budget, a target performance, and required cloud SLAs. By identifying and formalizing the first principles of storage engine layouts and core key-value algorithms, Cosine constructs a massive design space comprising of sextillion (10 36 ) possible storage engine designs over a diverse space of hardware and cloud pricing policies for three cloud providers - AWS, GCP, and Azure. Cosine spans across diverse designs such as Log-Structured Merge-trees, B-trees, Log-Structured Hash-tables, in-memory accelerators for filters and indexes as well as trillions of hybrid designs that do not appear in the literature or industry but emerge as valid combinations of the above. Cosine includes a unified distribution-aware I/O model and a learned concurrency-aware CPU model that with high accuracy can calculate the performance and cloud cost of any possible design on any workload and virtual machines. Cosine can then search through that space in a matter of seconds to find the best design and materializes the actual code of the resulting storage engine design using a templated Rust implementation. We demonstrate that on average Cosine outperforms state-of-the-art storage engines such as write-optimized RocksDB, read-optimized WiredTiger, and very write-optimized FASTER by 53x, 25x, and 20x, respectively, for diverse workloads, data sizes, and cloud budgets across all YCSB core workloads and many variants.
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 4e2b70e1-6d24-408c-a78a-64278c54ca6aCited by top-tier papers18
- TreeLine: An Update-In-Place Key-Value Store for Modern StorageGeoffrey X. Yu, Markos Markakis, Andreas Kipf, Per-Åke Larson et al.VLDB 2023 · 36 citations
- Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic WorkloadsDingheng Mo, Fanchao Chen, Siqiang Luo, Caihua ShanSIGMOD 2024 · 26 citations
- SageDB: An Instance-Optimized Data Analytics SystemJialin Ding, Ryan Marcus, Andreas Kipf, Vikram Nathan et al.VLDB 2022 · 18 citations
- GRF: A Global Range Filter for LSM-Trees with Shape EncodingHengrui Wang, Te Guo, Junzhao Yang, Huanchen ZhangSIGMOD 2024 · 15 citations
- CAMAL: Optimizing LSM-trees via Active LearningWeiping Yu, Siqiang Luo, Zihao Yu, Gao CongSIGMOD 2025 · 11 citations
Builds on12
- From WiscKey to Bourbon: A Learned Index for Log-Structured Merge TreesYifan Dai, Yien Xu, Aishwarya Ganesan, Ramnatthan Alagappan et al.OSDI 2020 · 138 citations
- Fast RDMA-based Ordered Key-Value Store using Remote Learned CacheXingda Wei, Rong Chen, Haibo ChenOSDI 2020 · 93 citations
- Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value StoresSiqiang Luo, Subarna Chatterjee, Rafael Ketsetsidis, Niv Dayan et al.SIGMOD 2020 · 91 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
- Constructing and Analyzing the LSM Compaction Design SpaceSubhadeep Sarkar, Dimitris Staratzis, Zichen Zhu, Manos AthanassoulisVLDB 2021 · 73 citations
Related papers
- Limousine: Blending Learned and Classical Indexes to Self-Design Larger-than-Memory Cloud Storage EnginesSubarna Chatterjee, Mark F. Pekala, Lev Kruglyak, Stratos IdreosSIGMOD 2024 · 9 citations
- Dynamic read & write optimization with TurtleKVTony Astolfi, Vidya Silai, Darby Huye, Lan Liu et al.VLDB 2026
- Keigo: Co-designing Log-Structured Merge Key-Value Stores with a Non-Volatile, Concurrency-aware Storage HierarchyRúben Adão, Zhongjie Wu, Changjun Zhou, Oana Balmau et al.VLDB 2025
- Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud DatabasesYingjia Wang, Caixin Gong, Guoyun Zhu, Sheng Wang et al.SIGMOD 2026 · 1 citation
- ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic WorkloadsJunfeng Liu, Haoxuan Xie, Siqiang LuoVLDB 2026
