PMDB: A Range-Based Key-Value Store on Hybrid NVM-Storage Systems

被引:2
作者
Zhang, Baoquan [1 ]
Gong, Haoyu [1 ]
Du, David H. C. [1 ]
机构
[1] Univ Minnesota, Dept Comp Sci, Minneapolis, MN 55455 USA
关键词
Non-volatile memory; key-value store; log-structured merge tree; interval tree;
D O I
10.1109/TC.2022.3202755
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Nov-Volatile Memory (NVM) may replace DRAM as main memory in future computers. However, data will likely still be stored on storage due to the enormous large size of available data. We investigate how key-value stores can be efficiently designed and implemented in a hybrid system, called NVM-Storage system, consisting of NVM as memory and traditional storage. We first discuss the performance trade-offs among Put, Get, and Range Query of the existing designs. Then, we propose PMDB, a range-based key-value store on NVM-Storage systems. PMDB achieves good performance for Put, Get and Range Query at the same time by utilizing a range-based data management and deploying a light-weight index on NVM. We compare PMDB with the state-of-theart schemes including SLM-DB [21] and MatrixKV [40] for hybrid NVM-storage systems. Evaluation results indicate that in workloads with mixed Put, Get and Range Queries, PMDB outperforms existing key-value stores by 1.16x - 2.49 x .
引用
收藏
页码:1274 / 1285
页数:12
相关论文
共 41 条
[1]   How to Build a Non-Volatile Memory Database Management System [J].
Arulraj, Joy ;
Pavlo, Andrew .
SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, :1753-1758
[2]  
Atikoglu Berk, 2012, Performance Evaluation Review, V40, P53, DOI 10.1145/2318857.2254766
[3]  
Balmau O, 2019, PROCEEDINGS OF THE 2019 USENIX ANNUAL TECHNICAL CONFERENCE, P753
[4]  
Cao ZC, 2020, PROCEEDINGS OF THE 18TH USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES, P209
[5]   A review of emerging non-volatile memory (NVM) technologies and applications [J].
Chen, An .
SOLID-STATE ELECTRONICS, 2016, 125 :25-38
[6]  
Chen Haibo., 2017, ACM Transactions on Storage (TOS), V13, P1
[7]  
Cooper B. F., 2010, P 1 ACM S CLOUD COMP, P143, DOI DOI 10.1145/1807128.1807152
[8]   Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging [J].
Dayan, Niv ;
Idreos, Stratos .
SIGMOD'18: PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2018, :505-520
[9]   Monkey: Optimal Navigable Key-Value Store [J].
Dayan, Niv ;
Athanassoulis, Manos ;
Idreos, Stratos .
SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, :79-94
[10]  
DeCandia Giuseppe, 2007, Operating Systems Review, V41, P205, DOI 10.1145/1323293.1294281