Skip to content
Open access

Cutting to the Chase: NVMe-oF Fast-track for Replicated Persistent Key-value Stores

Aug 2026 · ACM Transactions on Architecture and Code Optimization (TACO) · 0 citations · 69 references

TL;DR

NoFDB is presented, an NVMe-oF-enabled RPKVS design that eliminates redundant index management and reduces replication latency, and introduces a set of system-level optimizations to address the challenges introduced by NVMe-oF and unlock its performance potential.

Abstract

Adopting replicated persistent key-value stores (RPKVSs) as metadata backends is becoming increasingly popular in modern large-scale storage systems. Conventional RPC-based KV replication is infamously subject to its replication overheads due to the inherent architectural mismatch between the application-level network stack and storage-prioritized operations. In this paper, we shift toward a new paradigm of storage-native block-based replication to fundamentally address the limitations of conventional replication. This shift is made possible by using widely deployed NVMe-oF technology to unify replication and storage efficiency under integrated block semantics. We present NoFDB, an NVMe-oF-enabled RPKVS design, that eliminates redundant index management and reduces replication latency, and introduces a set of system-level optimizations to address the challenges introduced by NVMe-oF and unlock its performance potential. Our evaluation shows that NoFDB improves random write throughput by up to 2.85 × and macrobenchmark throughput by up to 3.10 × over the best-performing baseline in each setting.

Read PDF

Similar papers

Aug 2026

Future-Proof Space Management in Relational Databases: Designs for ZNS Drives

As the volume of data in modern enterprise systems continues to grow exponentially, the demand for high-capacity, cost-effective storage solutions has never been more critical. To meet these demands, the industry is shifting away from traditional block-based paradigms toward zoned storage, an architecture that partitio...

Zhen-Yang Guo, Shang-Ze Wang, Chieh-Jen Wang et al. · 0 citations
Conference Aug 2026

Poster: AutoThermKV: An Efficient User-Transparent In-Memory Management of Hot Data for Key-Value Stores

Log-structured merge-tree (LSM-tree) key-value stores rely on caching to mitigate multi-component lookups and long tails, yet block and KP caches are prone to compactioninduced expiry, and all three cache types suffer from scan pollution under LRU eviction. We present AutoThermKV, a two-level in-memory architecture tha...

Yunfan Chi, E. Sha, Longshan Xu et al. · 0 citations
Book Open access Sep 2026

MiTDM: Eliminating False Conflicts in Scalable MVCC in Disaggregated Memory

MiTDM introduces a hierarchical block version chain that combines the benefits of array and chained structures, supporting dynamic version expansion while maintaining low-latency access, and achieves up to 80.1% higher throughput compared to FaRMV2 and 42.7% higher than Motor.

Ao-Xin Wei, Jin-Tian Wu, Jian Zhou et al. · 0 citations
Book Open access Sep 2026

Breaking the Single-Entry Bottleneck: Dynamic Write Routing for Heterogeneous Key-Value Stores

DuetKV is presented, a heterogeneous key-value store that treats NVM and SSD as peer foreground write engines and selects a destination for each request, and achieves up to 3.4 × the throughput of the strongest baseline on write-heavy workloads, while remaining competitive on read-heavy workloads.

Rui-Song Zhou, Liang Bao, Hai-Jun Zhang et al. · 0 citations
Book Open access Sep 2026

CmptQuiet: Optimizing Tail Latency and Throughput in LSM-Tree Key-Value Stores via Contention-Aware Compaction

Log-Structured Merge-Tree (LSM-tree) based Key-Value stores are foundational to data center storage but suffer from high tail latency due to a fundamental read-write trade-off and disruptive compaction. This paper introduces CmptQuiet, a system that breaks this trade-off to deliver low tail latency without sacrificing...

Jiu-Fei Liu, Kai-Yuan Xu, Shu Yin · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.