KVRangeDB: Range Queries for a Hash-based Key–Value Device
Open Access
- 19 June 2023
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 19 (3) , 1-21
Abstract
Key–value (KV) software has proven useful to a wide variety of applications including analytics, time-series databases, and distributed file systems. To satisfy the requirements of diverse workloads, KV stores have been carefully tailored to best match the performance characteristics of underlying solid-state block devices. Emerging KV storage device is a promising technology for both simplifying the KV software stack and improving the performance of persistent storage-based applications. However, while providing fast, predictable put and get operations, existing KV storage devices do not natively support range queries that are critical to all three types of applications described above. In this article, we present KVRangeDB, a software layer that enables processing range queries for existing hash-based KV solid-state disks (KVSSDs). As an effort to adapt to the performance characteristics of emerging KVSSDs, KVRangeDB implements log-structured merge tree key index that reduces compaction I/O, merges keys when possible, and provides separate caches for indexes and values. We evaluated the KVRangeDB under a set of representative workloads, and compared its performance with two existing database solutions: a Rocksdb variant ported to work with the KVSSD, and Wisckey, a key–value database that is carefully tuned for conventional block devices. On filesystem aging workloads, KVRangeDB outperforms Wisckey by 23.7× in terms of throughput and reduce CPU usage and external write amplifications by 14.3× and 9.8×, respectively.Keywords
Funding Information
- Samsung, Los Alamos National Lab and NSF (1439722, 1823403, 2203033)
This publication has 16 references indexed in Scilit:
- PebblesDB2017
- KV-Direct2017
- Fast scans on key-value storesProceedings of the VLDB Endowment, 2017
- KAML: A Flexible, High-Performance Key-Value SSD2017
- IndexFS: Scaling File System Metadata Performance with Stateless Caching and Bulk Insertion2014
- An efficient design and implementation of LSM-tree based key-value store on open-channel SSD2014
- Benchmarking cloud serving systems with YCSB2010
- DynamoACM SIGOPS Operating Systems Review, 2007
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970