通过散列在KV存储中实现高效更新:设计和性能评估
Enabling Efficient Updates in KV Storage via Hashing: Design and Performance Evaluation
摘要:
持久性键值(KV)存储主要建立在日志结构化合并(LSM)树上,以获得高写入性能,但LSM树受到固有的高I/O放大的影响。KV分离通过仅将键存储在LSM树中并将值存储在单独的存储中来减轻I/O放大。然而,当前KV分离设计在更新密集型工作负载下仍然是低效的,这是由于其在值存储中的高垃圾回收(GC)开销。我们提出了HashKV,其目标是在更新密集型工作负载下在KV分离之上实现高更新性能。HashKV使用基于散列的数据分组,它确定性地将值映射到存储空间,以便使更新和GC都高效。我们进一步放宽限制,这种确定性映射通过简单但有用的设计扩展。我们广泛评估了HashKV的各个设计方面。我们表明,与当前的KV分离设计相比,HashKV实现了4.6倍的更新吞吐量和53.4%的写入流量。此外,我们证明了我们可以将HashKV的设计与最先进的KV商店相结合,并提高各自的性能。
英文摘要:
Persistent key-value (KV) stores mostly build on the Log-Structured Merge (LSM) tree for high write performance, yet the LSM-tree suffers from the inherently high I/O amplification. KV separation mitigates I/O amplification by storing only keys in the LSM-tree and values in separate storage. However, the current KV separation design remains inefficient under update-intensive workloads due to its high garbage collection (GC) overhead in value storage. We propose HashKV, which aims for high update performance atop KV separation under update-intensive workloads. HashKV uses hash-based data grouping, which deterministically maps values to storage space so as to make both updates and GC efficient. We further relax the restriction of such deterministic mappings via simple but useful design extensions. We extensively evaluate various design aspects of HashKV. We show that HashKV achieves 4.6x update throughput and 53.4% less write traffic compared to the current KV separation design. In addition, we demonstrate that we can integrate the design of HashKV with state-of-the-art KV stores and improve their respective performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。