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

Baoquan Zhang, Haoyu Gong, David H.C. Du

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Emerging 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-the-art 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.16× - 2.49×.

Original languageEnglish (US)
Pages (from-to)1274-1285
Number of pages12
JournalIEEE Transactions on Computers
Volume72
Issue number5
DOIs
StatePublished - May 1 2023

Bibliographical note

Publisher Copyright:
IEEE

Keywords

  • Non-volatile memory
  • interval tree
  • key-value store
  • log-structured merge tree

Fingerprint

Dive into the research topics of 'PMDB: A Range-Based Key-Value Store on Hybrid NVM-Storage Systems'. Together they form a unique fingerprint.

Cite this