write-optimized-dictionary · shipping · also Write-optimized index, Write-optimized data structure, WOD, WOI, WODS

Write-optimized dictionary

A write-optimized dictionary is a key-value data structure that defers and batches updates to amortize storage work while supporting queries.

Related Observatory article: Write-optimized dictionary on hesela.com

The research category includes B-epsilon trees, LSM-trees and cache-oblivious lookahead arrays. It is not one file format, one filesystem or a synonym for a write-back cache. Families differ in their query and update bounds. [1]

Buffering changes when work is performed, not whether correctness conditions apply. Compare the particular implementation's query, deletion, maintenance and durability behavior; the category name alone does not specify those contracts. [1]

Relations

related
B-epsilon tree, Log-structured merge-tree, Buffered upsert, BetrFS

Citations

  1. Yuan et al. Optimizing Every Operation in a Write-Optimized File System. FAST 2016, sections 1-2; dictionary terminology and interface. (accessed 2026-11-04)

Further reading

  1. Hesela: B-epsilon trees, visible updates and deferred work (accessed 2026-11-04)

JSON: /data/terms/write-optimized-dictionary.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Write-optimized dictionary. Hesela. 2026-11-04. https://hesela.dev/terms/write-optimized-dictionary/