.png){kind=icon}
返回
FenceKV: Enabling Efficient Range Query for Key-Value Separation
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2022.3149003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
LSM-tree is widely used in key-value stores for big data storage, but it suffers from write amplification brought by frequent compaction operations. An effective solution for this problem is key-value separation, which decouples values from the LSM-tree and stores them in a separate value log. However, existing key-value separation schemes achieve poor range query performance, especially for small key-value pairs, because they focus on mitigating write amplification but neglect access characteristics of the SSD. In this article, we propose FenceKV, which aims to achieve better range query performance while maintaining reasonable update performance for update-intensive workloads. FenceKV employs a new partition method to map values to the storage space based on the key-range to achieve efficient update and range query. Moreover, it adopts a key-range garbage collection policy to mitigate the garbage collection overhead and maintain sequential access for range queries. We compare FenceKV with modern key-value stores with various workloads, and results show that FenceKV can improve the range query performance significantly, while maintaining reasonable update performance compared to the existing designs of key-value separation.
Keyword:
Compaction
Performance evaluation
Throughput
Metadata
Space exploration
Optimization
Machine learning algorithms
LSM-tree
key-value store
key-value separation
range query
SSD
期刊
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分享收藏Ultrafiltration to characterize PM2.5 water-soluble iron and its sources in an urban environment
PREAI
分享收藏
查看更多内容