Breaking Down Memory Walls in LSM-based Storage Systems
Breaking Down Memory Walls in LSM-based Storage Systems
复制标题
打破基于 LSM 的存储系统中的内存墙
DOI：
10.1145/3318464.3384399
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Luo, Chen
中科院分区：
文献类型：
--
作者：
Luo, Chen
日志结构归并树(LSM-tree)[16，18]广泛应用于现代NoSQL系统中。与传统的就地更新结构不同，LSM树首先缓冲内存中的所有写操作，然后在内存满时将这些写操作刷新到磁盘。磁盘上的组件通常被组织成大小呈指数级增长的级别，其中较小的级别在填满时合并到相邻的较大级别中。为了限制合并占用的临时磁盘空间，现代LSM树实现通常将一个磁盘组件划分为许多固定大小的SSTable
The log-structured merge-tree (LSM-tree) [16, 18] is widely used in modern NoSQL systems. Different from traditional update-in-place structures, an LSM-tree first buffers all writes in memory, which are subsequently flushed to disk when memory is full. The on-disk components are usually organized into levels of exponentially increasing sizes, where a smaller level is merged into the adjacent larger level when it fills up. To bound the temporary disk space occupied by merges, modern LSM-tree implementations often range partition a disk component into many fixed-size SSTables
DOI：
10.1002/spe.2799
发表时间：
2020-02
期刊：
Software: Practice and Experience
影响因子：
--
作者：
Taewoo Kim;Alexander Behm;Michael Blow;V. Borkar;Yingyi Bu;M. Carey;Murtadha Ai Hubail;Shiva Jahangiri;Jianfeng Jia;Chen Li;Chen Luo;Ian Maxon;Pouria Pirzadeh
通讯作者：
Taewoo Kim;Alexander Behm;Michael Blow;V. Borkar;Yingyi Bu;M. Carey;Murtadha Ai Hubail;Shiva Jahangiri;Jianfeng Jia;Chen Li;Chen Luo;Ian Maxon;Pouria Pirzadeh