{
  "slug": "skimpystash",
  "term": "SkimpyStash",
  "aliases": [],
  "definition": "SkimpyStash is a research flash key-value store that reduces RAM indexing overhead by placing bucket chains on flash.",
  "note": "The enhanced design uses two-choice placement and per-bucket Bloom filters; compaction packs chain records into fewer flash pages. Updates stay in their original bucket to keep versions together. [skimpystash-paper]\n\nA positive filter result still requires searching a chain. Increasing mean bucket occupancy reduces directory bytes per key but can increase lookup work; index memory is not total process RAM. [skimpystash-paper]",
  "status": "research",
  "advantages": [],
  "limitations": [],
  "related": [
    "flashstore",
    "silt",
    "fawn-ds",
    "bloom-filter",
    "read-amplification"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-14",
  "citations": [
    {
      "id": "skimpystash-paper",
      "title": "Debnath, Sengupta and Li. SkimpyStash: RAM Space Skimpy Key-Value Store on Flash-based Storage. SIGMOD 2011, sections 4.3-4.6 and 5.1-5.2.",
      "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/sigmod038-sengupta.pdf",
      "accessed": "2026-11-14"
    }
  ],
  "provenance": [
    "Historical primary-source review. The linked directory calculation is arithmetic, not a SkimpyStash reproduction."
  ]
}