silt · research · also Small Index Large Table

SILT

SILT is a research flash key-value store that combines write-friendly and compact read-only stores to reduce in-memory indexing overhead.

Related Observatory article: SILT on hesela.com

Its SortedStore trie supplies a candidate location, not proof of membership. [1] The pinned implementation compares retrieved full keys before returning a value. [2]

The 2011 design uses asynchronous updates, so completed writes need not yet be durable. [1]

Relations

related
Read amplification, Bloom filter, Cuckoo filter, Sorted run

Citations

  1. Hyeontaek Lim, Bin Fan, David G. Andersen and Michael Kaminsky. SILT: A Memory-Efficient, High-Performance Key-Value Store. SOSP 2011, sections 2-4. (accessed 2026-11-02)
  2. SILT authors' implementation, commit 9970432b27db7b9ef3f23f56cdd0609183e9fd83. FawnDS_SF_Ordered_Trie::Get: candidate block and full-key comparison. (accessed 2026-11-02)

Further reading

  1. Hesela: SILT location indexes and an exhaustive synthetic byte-domain example. (accessed 2026-11-02)
Sources & caveats
  • Historical source review; not a current product recommendation or reproduced SILT benchmark.
  • The linked four-key byte-domain demonstration is original educational code, not the authors' entropy-coded trie.

JSON: /data/terms/silt.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. SILT. Hesela. 2026-11-02. https://hesela.dev/terms/silt/