.png){kind=icon}
返回
Building an Efficient Put-Intensive Key-Value Store with Skip-Tree
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2016.2609912.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-component based Log-Structured Merge-tree (LSM-tree) has been becoming one of the mainstream indexes. LSM-tree adopts component-by-component KV item flowing down mechanism to push each KV item from one smaller component to the adjacent larger component during compaction procedures until the KV items reach the largest component. This process incurs significant write amplification and limits the write throughput. In this paper, we propose one multi-component Skip-tree to aggressively push the KV items to the non-adjacent larger components via skipping some components and then make the KV items' top-down move more efficient. We develop adaptive and reliable KV item movements among components. By reducing the number of steps during the flowing process from memory-resident component to the disk-resident largest component, Skip-tree can effectively reduce the write amplification and thus improve the system throughput. We design and implement one high performance key-value store, named SkipStore, based on Skip-tree. The experiments demonstrate that SkipStore outperforms the state-of-the-art open-sourced system RocksDB in Facebook by 66.5 percent under HDD and 61 percent under SSD.
Keyword:
Storage system
KV store
LSM-tree
compaction
performance optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
分享收藏Facile preparation of in situ coated Ti3C2Tx/Ni0.5Zn0.5Fe2O4composites and their electromagnetic performance原位涂层Ti3C2Tx/Ni0.5Zn0.5Fe2O4 复合材料及其电磁性能.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏Four-Antigen Mixture Containing V-Cyclin for Serological Screening of Human Herpesvirus 8 InfectionOAAI
OAAI分享收藏Improving Update-Intensive Workloads on Flash Disks through Exploiting Multi-Chip Parallelism通过利用多芯片并行性改进闪存磁盘上的更新密集型工作负载
PREAI
分享收藏
查看更多内容