Deduplication adapted CaseDB for edge computing

被引：0

作者：

Tulkinbekov K. ^{[1
]}

Kim J.-H. ^{[1
]}

Kim D.-H. ^{[1
]}

机构：

[1] Department of Electronic Engineering, Inha University, Incheon

来源：

IEIE Transactions on Smart Processing and Computing | 2020年 / 9卷 / 04期

基金：

新加坡国家研究基金会;

关键词：

CaseDB; Deduplication; Key-value store; Space amplification; Write amplification;

D O I：

10.5573/IEIESPC.2020.9.4.317

中图分类号：

学科分类号：

摘要：

Log-structured merge-tree (LSM-tree) family key-value stores are becoming the databases most in demand for big data systems. They provide an easy-to-implement interface, and they automatically perform garbage collection by applying a compaction procedure over the multilevel structure. CaseDB offers various advantages by reducing write amplification considerably, using a metadata compaction technique. However, it suffers from a space amplification problem in update-intensive workloads. As an implementation of the LSM-tree structure, CaseDB refuses to instantly perform deletes, but delays them for the compaction process, resulting in an increasing amount of deprecated data. This paper proposes a deduplication extended compaction method for CaseDB. It scans for duplicated keys within the compaction method and removes the old values. Experiment results show that the proposed technique offers various threshold values of deduplication for different balances between space amplification and write amplification. Copyrights © 2020 The Institute of Electronics and Information Engineers

引用

页码：317 / 324

页数：7

共 22 条

[1]

O'Neil P., Cheng E., Gawlick D., O'Neil E., The log-structured merge-tree (LSM-Tree), Acta Informatica, 33, pp. 351-385, (1996)

[2]

Tulkinbekov K., Pirahandeh M., Kim D., CLeveldb: Coalesced Leveldb for Small Data, 2019 Eleventh International Conference on Ubiquituos and Future Networks (ICUFN), pp. 567-569, (2019)

[3]

Sears R., Ramakrishnan R., bLSM: A general purpose log structured merge tree, Proc. ACM SIGMOND Int. Conf. Manage. Data, pp. 217-228, (2012)

[4]

(2016)

[5]

(2016)

[6]

(2019)

[7]

DeCandia G., Et al., Dynamo: Amazon's highly available key-value store, Proc. 21st ACM SIGOPS Symp. Operating Syst. Prinsiples, pp. 205-220, (2007)

[8]

Zhang W., Xu Y., Li Y., Zhang Y., Li D., FlameDB: A Key-Value Store With Grouped Level Structure and Heteregeneous Bloom Filter, IEEE Access, 6, pp. 24962-24972, (2018)

[9]

Zang K., Kim J., Cho G., An Efficient and Energy-saving Data Dissemination Mechanism for Low-power and Lossy Networks, J. IEIE Trans. on Smart Processing and Computing, 7, 4, pp. 271-278, (2018)

[10]

Ting Y., Jiguang W., Ping H., Xubin H., Fei W., Changsheng X., Building Efficient Key-Value Stores via a Lightweight Compaction Tree, ACM Transactions on Storage, 13, pp. 1-28, (2017)

← 1 2 3 →