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 条
  • [41] ShieldStore: Shielded In-memory Key-value Storage with SGX
    Kim, Taehoon
    Park, Joongun
    Woo, Jaewook
    Jeon, Seungheun
    Huh, Jaehyuk
    PROCEEDINGS OF THE FOURTEENTH EUROSYS CONFERENCE 2019 (EUROSYS '19), 2019,
  • [42] ForestDB: A Fast Key-Value Storage System for Variable-Length String Keys
    Ahn, Jung-Sang
    Seo, Chiyoung
    Mayuram, Ravi
    Yaseen, Rahim
    Kim, Jin-Soo
    Maeng, Seungryoul
    IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (03) : 902 - 915
  • [43] Towards Building a High-Performance, Scale-In Key-Value Storage System
    Kang, Yangwook
    Pitchumani, Rekha
    Mishra, Pratik
    Kee, Yang-suk
    Londono, Francisco
    Oh, Sangyoon
    Lee, Jongyeol
    Lee, Daniel D. G.
    SYSTOR '19: PROCEEDINGS OF THE 12TH ACM INTERNATIONAL SYSTEMS AND STORAGE CONFERENCE, 2019, : 144 - 154
  • [44] Learned FBF: Learning-Based Functional Bloom Filter for Key-Value Storage
    Byun, Hayoung
    Lim, Hyesook
    IEEE TRANSACTIONS ON COMPUTERS, 2022, 71 (08) : 1928 - 1938
  • [45] Check-In: In-Storage Checkpointing for Key-Value Store System Leveraging Flash-Based SSDs
    Yoon, Joohyeong
    Jeong, Won Seob
    Ro, Won Woo
    2020 ACM/IEEE 47TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE (ISCA 2020), 2020, : 693 - 706
  • [46] Data layout management for energy-saving key-value storage using a write off-loading technique
    Kan, Masaki
    Kobayashi, Dai
    Yokota, Haruo
    2012 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM), 2012,
  • [47] Improving Write Performance of LSMT-based Key-Value Store
    Zhang, WeiTao
    Xu, Yinlong
    Li, Yongkun
    Li, Dinglong
    2016 IEEE 22ND INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2016, : 553 - 560
  • [48] Differentiated Key-Value Storage Management for Balanced I/O Performance
    Li, Yongkun
    Liu, Zhen
    Lee, Patrick P. C.
    Wu, Jiayu
    Xu, Yinlong
    Wu, Yi
    Tang, Liu
    Liu, Qi
    Cui, Qiu
    PROCEEDINGS OF THE 2021 USENIX ANNUAL TECHNICAL CONFERENCE, 2021, : 673 - 687
  • [49] Design and implementation of an efficient flushing scheme for cloud key-value storage
    Yongseok Son
    Heon Young Yeom
    Hyuck Han
    Cluster Computing, 2017, 20 : 3551 - 3563
  • [50] PRISM: Optimizing Key-Value Store for Modern Heterogeneous Storage Devices
    Song, Yongju
    Kim, Wook-Hee
    Monga, Sumit Kumar
    Min, Changwoo
    Eom, Young Ik
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS, VOL 2, ASPLOS 2023, 2023, : 588 - 602