ZonesDB: Building Write-Optimized and Space-Adaptive Key-Value Store on Zoned Storage with Fragmented LSM Tree
Open Access
- 19 March 2025
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (2) , 1-24
Abstract
The zoned storage has revolutionized the decades-old block storage in lowering the cost-per-gigabyte while enabling the host system to achieve better performance. With such benefit of cost and performance, we still require careful consideration on the endurance when deploying the applications on the zoned storage, since the modern storage tends to trade its endurance for larger capacity at lower cost. In this regard, although previous studies have deployed the log-structure merge (LSM-tree)-based key-value (KV) store on the zoned storage, the LSM-tree-based KV store can be suboptimal choice to build a cost-effective KV store on zoned storage, since LSM-tree has a well-known problem of write amplification (WA). Therefore, based on the key insight that the Fragmented Log-Structured Merge tree (FLSM-tree) substantially alleviates the notorious write amplification problem of the classical LSM-tree and inherently complies with the sequential write constraint of zoned storage, FLSM-tree would be a promising design choice to build a cost-effective KV store on zoned storage. However, based on our investigation, deploying an FLSM-tree-based KV store on zoned storage faces two challenges: The write amplification of the host-initiated garbage collection (GC) cancels out the low WA merit of FLSM-tree, and FLSM-tree results in high space amplification to increase the cost. In this regard, this article presents ZonesDB , a novel FLSM-tree-based KV store that comes with a series of innovative “zone-aware” techniques for pursuing write optimality and space adaptability. Our evaluations, based on two types of production-grade zoned storage (i.e., ZNS SSD and HM-SMR HDD), reveal that ZonesDB can bring into play the low WA merit of FLSM-tree, deliver outstanding write performance, and mitigate the space amplification problem of FLSM-tree on zoned storage.Keywords
Funding Information
- The Research Grants Council of Hong Kong SAR (CUHK14218522)
This publication has 18 references indexed in Scilit:
- Open Block Characterization and Read Voltage Calibration of 3D QLC NAND Flash2020
- Reliability of 3D NAND flash memory with a focus on read voltage calibration from a system aspect2019
- SEALDB: An Efficient LSM-tree Based KV Store on SMR Drives with Sets and Dynamic BandsIEEE Transactions on Parallel and Distributed Systems, 2019
- Reinforcement Learning-Assisted Garbage Collection to Mitigate Long-Tail Latency in SSDACM Transactions on Embedded Computing Systems, 2017
- WiscKeyACM Transactions on Storage, 2017
- Skylight—A Window on Shingled Disk OperationACM Transactions on Storage, 2015
- Speeding up distributed request-response workflowsACM SIGCOMM Computer Communication Review, 2013
- BTRFSACM Transactions on Storage, 2013
- Indirection systems for shingled-recording disk drives2010
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996