LazyStore: Write-optimized Key-value Storage System Based on Hybrid Storage Architecture

被引:0
|
作者
Du, Yun-Xiao [2 ,3 ]
Chen, Ke [1 ,3 ]
Shou, Li-Dan [1 ,3 ]
Jiang, Da-Wei [1 ,3 ]
Luo, Xin-Yuan [1 ,3 ]
Chen, Gang [1 ,3 ]
机构
[1] College of Computer Science and Technology, Zhejiang University, Hangzhou,310027, China
[2] School of Software Technology, Zhejiang University, Hangzhou,310027, China
[3] Key Laboratory of Big Data Intelligent Computing of Zhejiang Province, Zhejiang University, Hangzhou,310027, China
来源
Ruan Jian Xue Bao/Journal of Software | 2025年 / 36卷 / 02期
关键词
Nonvolatile storage - Trees (mathematics);
D O I
10.13328/j.cnki.jos.007145
中图分类号
学科分类号
摘要
Log-structured merge-tree (LSM-tree) based key-value storage is widely used in many applications due to its excellent read and write performance. Most existing LSM-trees utilize a multi-level structure to store data. Although the multi-level data structure can serve moderately write-intensive applications well, this structure is not well suited for highly write-intensive applications. This is because storing data in multi-levels introduces the write amplification problem, where new data insertion triggers the reorganization of a large portion of the data already stored in multiple levels. This huge (and sometimes frequent) data reorganization is expensive and degrades write performance in many highly write-intensive applications. In addition, the multi-level structure does not provide consistently excellent read performance for hot data. This is because the multi-level structure cannot optimize the read operation of hot data by merging overlapping ranges in a timely manner. To address the above two challenges, this study proposes LazyStore, a novel single-level LSM-tree based on a hybrid storage architecture. LazyStore solves the write amplification problem by storing data in a single logical level instead of multiple logical levels. As a result, expensive multi-level data reorganization is largely eliminated. To further improve write performance, LazyStore distributes data at the logical level to multiple storage devices, such as DRAM, NVM, and SSD, based on the capacity and read/write performance of each storage device. Furthermore, LazyStore introduces real-time merge operations to improve the read performance of hot data ranges. Experiments show that LazyStore improves write performance by 3 times and reduces write amplification by nearly 4 times compared to other multi-level LSM-trees. For hot range reads, LazyStore’s real-time data merge optimization can reduce the latency of range query processing by a factor of two. © 2025 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:805 / 829
相关论文
共 50 条
  • [31] Flashield: a Hybrid Key-value Cache that Controls Flash Write Amplification
    Eisenman, Assaf
    Cidon, Asaf
    Pergament, Evgenya
    Haimovich, Or
    Stutsman, Ryan
    Alizadeh, Mohammad
    Katti, Sachin
    PROCEEDINGS OF THE 16TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION, 2019, : 65 - 78
  • [32] Parallax: Hybrid Key-Value Placement in LSM-based Key-Value Stores
    Xanthakis, Giorgos
    Saloustros, Giorgos
    Batsaras, Nikos
    Papagiannis, Anastasios
    Bilas, Angelos
    PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC '21), 2021, : 305 - 318
  • [33] Private Set Intersection Based on Lightweight Oblivious Key-Value Storage Structure
    Jiang, Zhengtao
    Guo, Xiaoxuan
    Yu, Ting
    Zhou, Hanyu
    Wen, Jiaqi
    Wu, Zhengyang
    SYMMETRY-BASEL, 2023, 15 (11):
  • [34] Research of Massive Data Caching Strategy Based on Key-Value Storage Model
    Wang, Lei
    Chen, Gongxin
    Wang, Kun
    INTELLIGENCE SCIENCE AND BIG DATA ENGINEERING: BIG DATA AND MACHINE LEARNING TECHNIQUES, ISCIDE 2015, PT II, 2015, 9243 : 443 - 453
  • [35] Experimental Framework for Searching Large RDF on GPUs based on Key-Value Storage
    Choksuchat, Chidchanok
    Chantrapornchai, Chantana
    2013 10TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE), 2013, : 171 - 176
  • [36] InK: In-Kernel Key-Value Storage with Persistent Memory
    Ha, Minjong
    Kim, Sang-Hoon
    ELECTRONICS, 2020, 9 (11) : 1 - 22
  • [37] The Design and Implementation of UniKV for Mixed Key-Value Storage Workloads
    Zhang, Qiang
    Li, Yongkun
    Lee, Patrick P. C.
    Xu, Yinlong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (11) : 11935 - 11949
  • [38] ArkDB: A Key-Value Engine for Scalable Cloud Storage Services
    Pang, Zhu
    Lu, Qingda
    Chen, Shuo
    Wang, Rui
    Xu, Yikang
    Wu, Jiesheng
    SIGMOD '21: PROCEEDINGS OF THE 2021 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2021, : 2570 - 2583
  • [39] Indexing spatiotemporal trajectory data streams on key-value storage
    Zhao, Xiaofei
    Lam, Kam-Yiu
    Kuo, Tei-Wei
    COMPUTING, 2024, 106 (08) : 2707 - 2735
  • [40] A convergence of key-value storage systems from clouds to supercomputers
    Li, Tonglin
    Zhou, Xiaobing
    Wang, Ke
    Zhao, Dongfang
    Sadooghi, Iman
    Zhang, Zhao
    Raicu, Ioan
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2016, 28 (01): : 44 - 69