arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.05074cs.DBcs.DScs.IR
收藏

Autumn:一种可扩展的读优化 LSM-tree 键值存储,具有快速的点读与范围读速度

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed

Fuheng Zhao, Zach Miller, Leron Reznikov, Divyakant Agrawal, Amr El Abbadi

AI总结:

Autumn 提出 Garnering 合并策略动态调整层级容量比,将 LSM-tree 键值存储的点读和范围读复杂度从 O(logN) 降至 O(√logN),同时保持更新性能,并在 LevelDB 上验证了真实负载下的性能提升。

摘要:

基于日志结构合并树(LSM-tree)的键值存储被广泛应用于许多存储系统中,以支持更新、点读和范围读等多种操作。传统上,LSM-tree 的合并策略将数据组织为容量指数增长的多个层级,以支持高速写入。然而,我们认为传统的合并策略并未针对读取进行优化。在这项工作中,我们提出了 Autumn,一种可扩展且读优化的基于 LSM-tree 的键值存储,具有最小的点读和范围读成本。提升读取性能的关键思想是随着存储数据的增多,动态调整两个相邻层级之间的容量比。因此,较小的层级逐渐增加其容量并更频繁地进行合并。特别是,通过应用新颖的 Garnering 合并策略,Autumn 将点读和范围读成本从先前已知的最优 $O(logN)$ 复杂度改进为 $O(\sqrt{logN})$。Garnering 合并策略在同时优化点读和范围读的同时,仍保持较高的更新性能。此外,为了进一步降低更新成本,Autumn 使用少量有界 DRAM 空间来固定/保留 LSM-tree 的第一层。我们在 LevelDB 之上实现了 Autumn,并通过实验展示了其在真实世界工作负载下的性能提升。

英文摘要:

The Log Structured Merge Trees (LSM-tree) based key-value stores are widely used in many storage systems to support a variety of operations such as updates, point reads, and range reads. Traditionally, LSM-tree's merge policy organizes data into multiple levels of exponentially increasing capacity to support high-speed writes. However, we contend that the traditional merge policies are not optimized for reads. In this work, we present Autumn, a scalable and read optimized LSM-tree based key-value stores with minimal point and range read cost. The key idea in improving the read performance is to dynamically adjust the capacity ratio between two adjacent levels as more data are stored. As a result, smaller levels gradually increase their capacities and merge more often. In particular, the point and range read cost improves from the previous best known $O(logN)$ complexity to $O(\sqrt{logN})$ in Autumn by applying the novel Garnering merge policy. While Garnering merge policy optimizes for both point reads and range reads, it maintains high performance for updates. Moreover, to further improve the update costs, Autumn uses a small amount of bounded space of DRAM to pin/keep the first level of LSM-tree. We implemented Autumn on top of LevelDB and experimentally showcases the gain in performance for real world workloads.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑