EUVIMEDEUVIMED entdecken
Crossref

PartitionKV: Redesigning LSM-tree KV Stores on NVMs with Adaptive Partitioning for Reducing Write Stalls and Amplification

Xingye Huang, Jinyu Wu, Xiaofang Xia, Jiangtao Cui, Hui Li, Liang Wang, Feng Zhang

Proceedings of the ACM on Management of Data · 02.04.2026 · 4 (1) · 1-26

DOI: 10.1145/3786676 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 07.04.2026. Verfasst von Xingye Huang und 6 weiteren Autor:innen. Die Arbeit nennt 55 Literaturangaben. Gefördert von: the Jing-Jin-Ji Regional Integrated Environmental Improvement-National Science and Technology Major Project of Ministry of Ecology and Environment of China, National Natural Science Foundation of China (NSFC), Youth Elite Scientist Sponsorship Program by China Association for Science and Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In write-intensive applications, the log-structured merge (LSM) trees are widely used as the basic index structure of key-value (KV) stores. Existing works integrate NVM into traditional DRAM-SSD architecture to improve write performance. However, these works still suffer from significant write stalls and amplification, mainly due to the inefficient L 0 - L 1 compaction caused by the unordered nature of data in L 0 of LSM-trees. To address these issues, we propose PartitionKV, a novel LSM-tree based KV store designed for the DRAM-NVM-SSD storage architecture, which has three main design characteristics: (1) First, we design an ordered partition layer comprising multiple partitions to replace the Memtable components and L 0 of original LSM-trees. Incoming KVs are directly persisted into NVM Logs of designated partitions based upon keys. This design minimizes unnecessary data rewriting during compaction and can double as a write-ahead log, significantly reducing write amplification. (2) Second, we introduce an adaptive partitioning strategy that dynamically splits or merges partitions based on the number of overlapping SSTables, ensuring that an optimal amount of data is involved in each compaction. (3) Third, we propose a multithreaded compaction strategy where multiple threads leverage two priority lists to efficiently coordinate concurrent data compaction between the partition layer and L 1 . By effectively integrating these two strategies, PartitionKV accelerates NVM space release and reduces write stalls significantly. We implement PartitionKV based on RocksDB and conduct extensive experiments to evaluate its performance. Results show that PartitionKV achieves 3.63× and 4.06× higher random write throughput than FlatLSM and MatrixKV, respectively.

Förderung

  • the Jing-Jin-Ji Regional Integrated Environmental Improvement-National Science and Technology Major Project of Ministry of Ecology and Environment of China
  • National Natural Science Foundation of China (NSFC)
  • Youth Elite Scientist Sponsorship Program by China Association for Science and Technology
  • Innovation Capability Support Program of Shaanxi Province

Zitieren

APA

Huang, X., Wu, J., Xia, X., Cui, J., Li, H., Wang, L., & Zhang, F. (2026). PartitionKV: Redesigning LSM-tree KV Stores on NVMs with Adaptive Partitioning for Reducing Write Stalls and Amplification. Proceedings of the ACM on Management of Data, 4(1), 1-26. https://doi.org/10.1145/3786676

Vancouver

Huang X, Wu J, Xia X, Cui J, Li H, Wang L, et al. PartitionKV: Redesigning LSM-tree KV Stores on NVMs with Adaptive Partitioning for Reducing Write Stalls and Amplification. Proceedings of the ACM on Management of Data. 2026;4(1):1-26. doi:10.1145/3786676

BibTeX
@article{Huang2026,
  author = {Huang, Xingye and Wu, Jinyu and Xia, Xiaofang and Cui, Jiangtao and Li, Hui and Wang, Liang and Zhang, Feng},
  title = {PartitionKV: Redesigning LSM-tree KV Stores on NVMs with Adaptive Partitioning for Reducing Write Stalls and Amplification},
  journal = {Proceedings of the ACM on Management of Data},
  year = {2026},
  volume = {4},
  number = {1},
  pages = {1--26},
  doi = {10.1145/3786676}
}
Kostenlos starten →