{
  "slug": "silt",
  "term": "SILT",
  "aliases": [
    "Small Index Large Table"
  ],
  "definition": "SILT is a research flash key-value store that combines write-friendly and compact read-only stores to reduce in-memory indexing overhead.",
  "note": "Its SortedStore trie supplies a candidate location, not proof of membership. [silt-paper] The pinned implementation compares retrieved full keys before returning a value. [silt-code]\n\nThe 2011 design uses asynchronous updates, so completed writes need not yet be durable. [silt-paper]",
  "status": "research",
  "advantages": [],
  "limitations": [],
  "related": [
    "read-amplification",
    "bloom-filter",
    "cuckoo-filter",
    "sorted-run"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-02",
  "citations": [
    {
      "id": "silt-paper",
      "title": "Hyeontaek Lim, Bin Fan, David G. Andersen and Michael Kaminsky. SILT: A Memory-Efficient, High-Performance Key-Value Store. SOSP 2011, sections 2-4.",
      "url": "https://www.cs.cmu.edu/~dga/papers/silt-sosp2011.pdf",
      "accessed": "2026-11-02"
    },
    {
      "id": "silt-code",
      "title": "SILT authors' implementation, commit 9970432b27db7b9ef3f23f56cdd0609183e9fd83. FawnDS_SF_Ordered_Trie::Get: candidate block and full-key comparison.",
      "url": "https://github.com/silt/silt/blob/9970432b27db7b9ef3f23f56cdd0609183e9fd83/fawnds/fawnds_sf_ordered_trie.cc#L278-L375",
      "accessed": "2026-11-02"
    },
    {
      "id": "hesela-silt",
      "title": "Hesela: SILT location indexes and an exhaustive synthetic byte-domain example.",
      "url": "https://hesela.com/analyses/bloom-filters-lsm-read-cost/#silt-locator",
      "accessed": "2026-11-02"
    }
  ],
  "provenance": [
    "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."
  ]
}