Skip to content

SOS: A High-Performance Distributed Key-Value Store for Large-Scale Online Services

Aug 2026 · Proceedings of the VLDB Endowment · Vol 19, pp. 4237-4249 · 0 citations · 44 references

TL;DR

SOS is a distributed key-value store that bridges this gap by guaranteeing at most one physical disk I/O per operation, enforced by three co-designed components: a flat in-memory hash index with O (1) lookup; a disk storage engine with a hierarchical variable-size layout that limits internal fragmentation to ≈7.93%; and a write cache with asynchronous flush that fully decouples client-visible latency from device I/O.

Abstract

Large-scale online services—including web search, recommendation, and LLM inference workloads such as Retrieval-Augmented Generation (RAG) and KV-cache offloading—demand storage that handles petabyte-scale data under millisecond tail-latency SLAs. In-memory stores are cost-prohibitive at scale; disk-based systems sacrifice latency for capacity. We present SOS , a distributed key-value store that bridges this gap by guaranteeing at most one physical disk I/O per operation , enforced by three co-designed components: a flat in-memory hash index with O (1) lookup; a disk storage engine with a hierarchical variable-size layout that limits internal fragmentation to ≈7.93%; and a write cache with asynchronous flush that fully decouples client-visible latency from device I/O. Distributed strong consistency is provided by Primary-Based Chain Replication with Two-Phase Commit and an in-chain retry mechanism that reduces write failures to near-zero under transient hardware jitter. Single-node benchmarks show SOS achieves 704 K QPS under uniform YCSB-B (256 client threads) at P99 = 2 ms, and outperforms RocksDB by 10.0 × in throughput and 24.6 × in P99 latency on write-heavy YCSB-A, with write amplification of 1.00× (vs. 14–16×). Deployed at Tencent for several years, SOS manages over 50 PB and 7 trillion records—peaking at 550 M QPS—powering Yuanbao RAG, Hunyuan KV-cache, user portrait and other services with P99.9 read latencies below 5 ms, at a fraction of in-memory cost.

View source

Similar papers

Book Open access Sep 2026

Borges: A Low-Latency Distributed Shared Log on a CXL Memory/SSD Hybrid

Borges is presented, to the authors' knowledge, the first fault-tolerant shared log whose data and ordering state reside in a DRAM/SSD hybrid device accessed with Compute Express Link (CXL).

Hao-Wei Chen, Yi-Ming Xiang, Zhi-Peng Jia 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

S !"#$ : A Scalable and Resize-optimized Hash Index on Disaggregated Memory

A novel architecture called S !"#$, designed to enhance the performance of hash indexes in disaggregated memory, is introduced and the results show that S !"#$ outperforms state-of-the-art DM-optimized hash indexes by at most 6.7 → (RACE), 3.6 → (SepHash), and 1.8 → (Outback) in YCSB workloads, respectively.

Han-Tian Zha, Teng Ma, Bao-Tong Lu 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
Open access Aug 2026

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

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.

Liang Bao, Rui-Song Zhou, Hua Wang et al. · 0 citations
Preprint Aug 2026

MEMONDEMAND: A Memory Management System for Large-Scale Enterprise Data

On EnterpriseRAG-Bench, MEMONDEMAND outperforms the strongest published LB#1 result at every evaluated scale from 10M tokens through the complete 618M- token collection, and results on FinanceBench, HotpotQA, and FRAMES further show strong performance across financial, multi-hop, and fact-retrieval settings.

Xin-Yuan Song, Bo-Wen Zhu, H. Haque et al. · 0 citations

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