Skip to content

Enhancing Database Write Performance with the Write Operation Pushdown Framework

Aug 2026 · Proceedings of the VLDB Endowment · Vol 19, pp. 3847-3859 · 0 citations · 47 references

TL;DR

WOP leverages the redo-flush path to push down write operations and enhances the storage layer for semantic-aware execution and supports high pushdown capacity with minimal memory footprint through Lightweight Metadata Tracking.

Abstract

While ByteDance's database infrastructure continues to serve bursty user traffic, emerging large-scale interactive applications generate increasingly write-intensive workloads spanning all stages of the data lifecycle. In production environments, we observe that these workloads are consistently bottlenecked by a common write-path inefficiency rooted in cache-miss-induced remote page fetches. In compute-storage disaggregated architectures, such remote page accesses introduce substantial I/O latency that dominates write performance. To address this bottleneck, we propose Write Operation Pushdown (WOP), a framework that eliminates Fetch-Before-Write (FBW) from the write path by pushing eligible writes to the storage layer for asynchronous execution. WOP leverages the redo-flush path to push down write operations and enhances the storage layer for semantic-aware execution. WOP supports high pushdown capacity with minimal memory footprint through Lightweight Metadata Tracking. WOP preserves correctness and consistency in distributed deployments via carefully designed mechanisms. To prevent read stalls introduced by asynchronous execution, WOP integrates a Fetch-After-Write (FAW) optimization with localized, on-demand replay. Across production workloads, WOP achieves up to 3.33× throughput improvement. On synthetic benchmarks, WOP improves throughput by up to 6.7× and reduces average latency by up to 85.2%. These results show that WOP significantly enhances write efficiency in industrial-scale workloads while preserving correctness in disaggregated deployments.

View source

Similar papers

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

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

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-Xia Gong et al. · 0 citations
Book Open access Sep 2026

Token Write Amplification in LLM-Mediated State Stores

LLM-based applications increasingly rely on persistent state stores to maintain durable memories across long-running interactions. Unlike conventional storage systems, these stores often invoke LLMs on the write path to transform raw context into semantic state, shifting maintenance cost from bytes written to tokens pr...

Shi-Jun Yang, Shu-Heng Gao, Chao Yan et al. · 0 citations
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
Preprint Sep 2026

DiaLSM: Towards Write-Stall-Free Performance via Shard-based LSM-tree

Log-Structured Merge-tree (LSM) aims to achieve high write throughput, but is known to experience the write stall problems when subjected to sustained write pressure. We quantify the occurrence probability and average duration of write stalls in LSM using a queuing model in the write--flush--compaction pipeline, moving...

Hongsu Byun, Safdar Jamil, Honghyeon Yoo 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.