EUVIMEDEUVIMED entdecken
Crossref

Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases

Yingjia Wang, Caixin Gong, Guoyun Zhu, Sheng Wang, Zhengheng Wang, Huan Liu, Junzhi Shi, Wu Qin, Wei Zhang, Feifei Li, Ming-Chang Yang

Proceedings of the ACM on Management of Data · 02.04.2026 · 4 (1) · 1-25

DOI: 10.1145/3786667 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 07.04.2026. Verfasst von Yingjia Wang und 10 weiteren Autor:innen. Die Arbeit nennt 73 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Cloud databases revolutionize data processing and storage by providing on-demand and scalable services housed on the cloud infrastructure. Multi-tenancy and serverless are two key tenets transforming the cloud database architecture, offering significant cost savings and simplified user management. However, we found that cloud databases using LSM-tree-based key-value stores as the storage engine face a crucial conundrum when adopting this promising multi-tenant serverless architecture. Specifically, LSM-tree-based key-value store encounters a critical dilemma between maintaining performance service-level agreements (SLAs) for tenants and over-subscribing storage bandwidth for high cost-efficiency. In this paper, we present FlexEngine, a novel LSM-tree-based key-value store, which for the first time enables the practical and efficient adoption of LSM tree in multi-tenant serverless cloud databases. FlexEngine introduces a series of designs to navigate the above dilemma, including a two-level (i.e., partition- and node-level) I/O admission control framework and a two-stage compaction deferral mechanism. We implement FlexEngine on a commercially-deployed RocksDB and perform comprehensive experiments on both production traces and micro-level workloads. The experimental results demonstrate that FlexEngine can significantly improve the capability to over-subscribe storage bandwidth, which leads to high cost-efficiency, while still promising consistent performance SLAs for users.

Zitieren

APA

Wang, Y., Gong, C., Zhu, G., Wang, S., Wang, Z., Liu, H., Shi, J., Qin, W., Zhang, W., Li, F., & Yang, M. (2026). Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases. Proceedings of the ACM on Management of Data, 4(1), 1-25. https://doi.org/10.1145/3786667

Vancouver

Wang Y, Gong C, Zhu G, Wang S, Wang Z, Liu H, et al. Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases. Proceedings of the ACM on Management of Data. 2026;4(1):1-25. doi:10.1145/3786667

BibTeX
@article{Wang2026,
  author = {Wang, Yingjia and Gong, Caixin and Zhu, Guoyun and Wang, Sheng and Wang, Zhengheng and Liu, Huan and Shi, Junzhi and Qin, Wu and Zhang, Wei and Li, Feifei and Yang, Ming-Chang},
  title = {Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases},
  journal = {Proceedings of the ACM on Management of Data},
  year = {2026},
  volume = {4},
  number = {1},
  pages = {1--25},
  doi = {10.1145/3786667}
}
Kostenlos starten →