Skip to content
Open access

OTDB: A Key-Value Store Tailored for Overlapping Track-Based Disks

Sep 2026 · ACM Transactions on Architecture and Code Optimization (TACO) · 0 citations · 26 references

TL;DR

OTDB, a key-value store tailored for overlapping track-based Disks is proposed and a Heterogeneous Multi-Granular Zoned Storage scheme that separates Sorted String Tables (SSTables) from different LSM-tree levels and maps them to zones with differentiated characteristics is developed, which reduces zone reset costs and decreases the amount of data migrated during GC.

Abstract

Shingled Magnetic Recording (SMR) and Interlaced Magnetic Recording (IMR) technologies significantly increase disk storage density by overlapping internal tracks, but the resulting frequent read-modify-write(RMW) operations can cause severe performance jitter. Building Log-Structured Merge Tree (LSM-tree) based key-value stores on Host-Managed SMR (HM-SMR) and Host-Managed IMR (HM-IMR) enables tight integration between the sequential-write constraints of zoned storage devices and the software log-structured architecture. By redirecting data updates to new physical locations in an append-only manner, rather than overwriting old data in place on overlapped tracks, this design avoids RMW operations caused by track rewrites, thereby improving performance predictability and overall stability. However, existing key-value stores are not systematically designed for heterogeneous storage systems in which HM-SMR and HM-IMR coexist, which leads to evident deficiencies in data layout, compaction strategies, and garbage collection (GC) mechanisms. To address these challenges, we propose OTDB, a key-value store tailored for overlapping track-based Disks. First, we develop a Heterogeneous Multi-Granular Zoned Storage scheme that separates Sorted String Tables (SSTables) from different LSM-tree levels and maps them to zones with differentiated characteristics. By flexibly configuring zone sizes, this scheme reduces zone reset costs and decreases the amount of data migrated during GC. Second, we design a Cross-Level Forecasting Window Compaction strategy that proactively constructs compaction windows and performs SSTable reorganization, thereby reducing redundant compaction operations and effectively mitigating compaction-induced write amplification. Finally, we introduce a Cox-Guided Zoned GC mechanism that leverages survival analysis to accurately predict the remaining lifetime of SSTables and guides their intelligent placement and migration, substantially improving the efficiency and stability of GC. Experimental results show that, compared with the state-of-the-art approaches, OTDB achieves performance improvements of \(96.47\% \) –25.67 × in microbenchmarks and increases throughput by an average of 1.87 × under YCSB workloads.

Read PDF

Similar papers

Open access Sep 2026

Lightweight Cache Buffer Management and Data Allocation Strategy for Enhancing Read/Write Latency in SSDs

A Lightweight Cache Buffer Management (LCBM) strategy that avoids precise frequency tracking altogether and reduces the average read latency and the write response time, while eliminating the metadata overhead of counter- and LRU-based designs is introduced.

Li-Lung Hsieh, Qi-Cheng Wu, Yu-Pei Liang · 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

ZNStore: Decomposing the B+Tree Write Path for Zoned Namespace SSDs

Zoned Namespace (ZNS) SSDs expose a sequential-write zone interface that reduces flash-level write amplification and offers cost and capacity advantages over conventional SSDs. Yet this interface creates a semantic mismatch for B+Tree-based storage engines, whose updates are fine-grained and logically in-place. Our wri...

Bo Chen, Jin-Lei Hu, Cheng-Xiao Gong et al. · 0 citations
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
Book Open access Sep 2026

Disk-Based LSMs: An Unexpectedly Good Index for Partly Coherent CXL Memory

Abstract. We consider the design of an in-memory range index for systems with CXL shared memory in which only a small part of the memory is cache coherent. While existing index data structures can be ported to such a setting using a software-coherence approach, the result performs poorly. We find that the key reason is...

Kiranaraddi M. Hombal, Ji-Yu Hu, Marcos K. Aguilera 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

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