A Passive and Hybrid Data Persistence Scheme for LSM-tree based Relational Databases
ACM Transactions on Storage · 30.11.2026 · 22 (4) · 1-34
DOI: 10.1145/3813114 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Storage, online erschienen am 18.08.2026. Verfasst von Kecheng Huang und 4 weiteren Autor:innen. Die Arbeit nennt 57 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Key Research and Development Program of Shandong Province, Taishan Scholars Program, Research Grants Council of the Hong Kong Special Administrative Region, China.
Abstract (Originalsprache)
Storage engine is a crucial component in relational databases (RDBs). With the emergence of Internet services and applications, a recent technical trend is to deploy a Log-structured Merge Tree (LSM-tree) based storage engine. Although such an approach can achieve high performance and efficient storage space usage, it also brings a critical double-logging problem—In LSM-tree based RDBs, both the upper RDB layer and the lower storage engine layer implement redundant logging facilities, which perform synchronous and costly I/Os for data persistence. Unfortunately, such “double protection” does not provide extra benefits but only incurs heavy and unnecessary performance overhead. In this article, we propose a novel solution, called Passive Data Persistence Scheme (PASV), to address the double-logging problem in LSM-tree based RDBs. By completely removing Write-ahead Log (WAL) in the storage engine layer, we develop a set of mechanisms, including a passive memory buffer flushing policy, an epoch-based data persistence scheme, and an optimized partial data recovery process, to achieve reliable and low-cost data persistence during normal runs and also fast and efficient recovery upon system failures. We also comprehensively analyze the recovery inefficiencies inherent in the undetermined persistence speeds in real-world workloads, and propose a hybrid persistence scheme that incorporates virtual-flush-based recovery optimizations to achieve the optimal recovery performance when performing epoch-based persistence. We implement a fully functional, open-sourced prototype of PASV based on Facebook’s MyRocks. Evaluation results show that our solution can effectively improve system performance by increasing throughput by up to 49.9% and reducing latency by up to 89.3%, and it also saves disk I/Os by up to 42.9% and reduces recovery time by up to 4.8%. 1
Förderung
- Key Research and Development Program of Shandong Province
- Taishan Scholars Program
- Research Grants Council of the Hong Kong Special Administrative Region, China
- National Natural Science Foundation of China
Zitieren
APA
Huang, K., Liu, C., Shen, Z., Shao, Z., & Chen, F. (2026). A Passive and Hybrid Data Persistence Scheme for LSM-tree based Relational Databases. ACM Transactions on Storage, 22(4), 1-34. https://doi.org/10.1145/3813114
Vancouver
Huang K, Liu C, Shen Z, Shao Z, Chen F. A Passive and Hybrid Data Persistence Scheme for LSM-tree based Relational Databases. ACM Transactions on Storage. 2026;22(4):1-34. doi:10.1145/3813114
BibTeX
@article{Huang2026,
author = {Huang, Kecheng and Liu, Canran and Shen, Zhaoyan and Shao, Zili and Chen, Feng},
title = {A Passive and Hybrid Data Persistence Scheme for LSM-tree based Relational Databases},
journal = {ACM Transactions on Storage},
year = {2026},
volume = {22},
number = {4},
pages = {1--34},
doi = {10.1145/3813114}
}
EUVIMED