CaseDB: Lightweight Key-Value Store for Edge Computing Environment

被引:5
作者
Tulkinbekov, Khikmatullo [1 ]
Kim, Deok-Hwan [1 ]
机构
[1] Inha Univ, Dept Elect Engn, Incheon 22211, South Korea
基金
新加坡国家研究基金会;
关键词
Compaction; Nonvolatile memory; Big Data; Metadata; Edge computing; Databases; Merging; Key-value store; LSM-tree; NoSQL; write and space amplification; edge computing; TREE;
D O I
10.1109/ACCESS.2020.3016680
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Key-value stores based on a log-structured merge (LSM) tree have emerged in big data systems because of their scalability and reliability. An LSM-tree offers a multilevel data structure with a simple interface. However, it performs file rewrites at the disk level, which causes write amplification. This study is concerned with this problem in relation to an embedded board environment, which can be used in edge computing. Addressing the major problems associated with an LSM-tree, we propose a new key-value store named CaseDB, which aggressively separates keys and bloom filters on the non-volatile memory express (NVMe) drive and stores the values on the SSD. Our solution reduces the I/O cost and enhances the overall performance in a cost-efficient manner. CaseDB employs a memory component, CBuffer, to avoid small write operations, and a delayed value compaction technique that guarantees the sorted order for both keys and values. CaseDB also utilizes deduction-based data deduplication to prevent space amplification in the values layer. The experiments show that CaseDB outperforms LevelDB and WiscKey 5.7 and 1.8 times, respectively, with respect to data writes, and additionally improves the read performance by 1.5 times. CaseDB also avoids the space amplification of WiscKey.
引用
收藏
页码:149775 / 149786
页数:12
相关论文
共 50 条
  • [31] Rethinking Key-Value Store for Byte-Addressable Optane Persistent Memory
    Wu, Sung-Ming
    Chang, Li-Pin
    PROCEEDINGS OF THE 59TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, DAC 2022, 2022, : 805 - 810
  • [32] A Fast Learned Key-Value Store for Concurrent and Distributed Systems
    Li, Pengfei
    Hua, Yu
    Jia, Jingnan
    Zuo, Pengfei
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (06) : 2301 - 2315
  • [33] KVell: the Design and Implementation of a Fast Persistent Key-Value Store
    Lepers, Baptiste
    Balmau, Oana
    Gupta, Karan
    Zwaenepoel, Willy
    PROCEEDINGS OF THE TWENTY-SEVENTH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '19), 2019, : 447 - 461
  • [34] Key-value Store Chip Design for Low Power Consumption
    Tokusashi, Yuta
    Matsutani, Hiroki
    Amano, Hideharu
    2019 IEEE SYMPOSIUM IN LOW-POWER AND HIGH-SPEED CHIPS (COOL CHIPS 22), 2019,
  • [35] Rethinking key-value store for parallel I/O optimization
    Kougkas, Anthony
    Eslami, Hassan
    Sun, Xian-He
    Thakur, Rajeev
    Gropp, William
    INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2017, 31 (04) : 335 - 356
  • [36] A Multicore-Friendly Persistent Memory Key-Value Store
    Wang Q.
    Zhu B.
    Shu J.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2021, 58 (02): : 397 - 405
  • [37] Generalization and Implementation of RAM-Based Key-Value Store
    Tian, Tian
    Zhang, Chengfei
    Yu, Kai
    Zhang, Yiming
    Zhong, Ping
    2016 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE & COMPUTATIONAL INTELLIGENCE (CSCI), 2016, : 1412 - 1413
  • [38] TurboHash: A Hash Table for Key-value Store on Persistent Memory
    Zhao, Xingsheng
    Zhong, Chen
    Jiang, Song
    PROCEEDINGS OF THE 16TH ACM INTERNATIONAL SYSTEMS AND STORAGE CONFERENCE, SYSTOR 2023, 2023, : 35 - 48
  • [39] Building an Efficient Key-Value Store in a Flexible Address Space
    Chen, Chen
    Zhong, Wenshao
    Wu, Xingbo
    PROCEEDINGS OF THE SEVENTEENTH EUROPEAN CONFERENCE ON COMPUTER SYSTEMS (EUROSYS '22), 2022, : 51 - 68
  • [40] Constructing a scalable key-value store engine on multidisk system
    Nie, Shiqiang
    Niu, Jie
    Yu, Fangxing
    Ma, Jianqiang
    Zhu, Xingxing
    Wu, Weiguo
    JOURNAL OF SUPERCOMPUTING, 2025, 81 (01)