2026-05-14T23:26:48Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00217928 2025-01-19T15:19:59Z 581:10784:10790

NVKVS: Non-Volatile Memory Optimized Key-Value Separated LSM-Tree NVKVS: Non-Volatile Memory Optimized Key-Value Separated LSM-Tree Ryan, Nathanael Soenjoto Widodo Hiroki, Ohtsuji Erika, Hayashi Eiji, Yoshida Hirotake, Abe Kazuhiko, Kato Ryan, Nathanael Soenjoto Widodo Hiroki, Ohtsuji Erika, Hayashi Eiji, Yoshida Hirotake, Abe Kazuhiko, Kato [特集:情報システム論文] key-value-stores, log-structured merge-tree, non-volatile memory, RocksDB, key-value separation LSM-tree-based key-value stores (KVSs) with KV separation minimizes the write latency and write amplification of LSM-trees by writing the KV-pairs sequentially into a log file and indexing these KV pairs in an LSM-tree. As a tradeoff, the storage device must handle the parallel writes directly from the client, which can be detrimental to some storage devices such as non-volatile memory (NVM). Such tasks can easily overload the underlying memory buffers of NVM, especially when these KVSs are configured without a filesystem to manage IO congestion and minimize the latency during parallel workloads. In this paper, we discuss how to maximize the performance of NVM in LSM-trees with KV separation called Non-Volatile KVS (NVKVS). This approach features several optimizations such as asynchronous multithreading that decouples the client and write threads and reusable write-ahead log (WAL). With these optimizations, NVKVS has three benefits. First, it minimizes the write latency by using NVM. Second, it can saturate the NVM throughput through a user-configurable worker pool and optimizations. Third, it leverages the endurance of NVM to maximize the lifespan of the SSD. Our experimental testings show that NVKVS produces better latencies and over double the throughput of other the tested KVS. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI　http://dx.doi.org/10.2197/ipsjjip.30.332 ------------------------------ LSM-tree-based key-value stores (KVSs) with KV separation minimizes the write latency and write amplification of LSM-trees by writing the KV-pairs sequentially into a log file and indexing these KV pairs in an LSM-tree. As a tradeoff, the storage device must handle the parallel writes directly from the client, which can be detrimental to some storage devices such as non-volatile memory (NVM). Such tasks can easily overload the underlying memory buffers of NVM, especially when these KVSs are configured without a filesystem to manage IO congestion and minimize the latency during parallel workloads. In this paper, we discuss how to maximize the performance of NVM in LSM-trees with KV separation called Non-Volatile KVS (NVKVS). This approach features several optimizations such as asynchronous multithreading that decouples the client and write threads and reusable write-ahead log (WAL). With these optimizations, NVKVS has three benefits. First, it minimizes the write latency by using NVM. Second, it can saturate the NVM throughput through a user-configurable worker pool and optimizations. Third, it leverages the endurance of NVM to maximize the lifespan of the SSD. Our experimental testings show that NVKVS produces better latencies and over double the throughput of other the tested KVS. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI　http://dx.doi.org/10.2197/ipsjjip.30.332 ------------------------------ 2022-05-15 eng journal article https://ipsj.ixsq.nii.ac.jp/records/217928 1882-7764 AN00116647 情報処理学会論文誌 63 5 https://ipsj.ixsq.nii.ac.jp/record/217928/files/IPSJ-JNL6305002.pdf application/pdf 1.1 MB 2024-05-15