skimpystash · research

SkimpyStash

SkimpyStash is a research flash key-value store that reduces RAM indexing overhead by placing bucket chains on flash.

Related Observatory article: SkimpyStash on hesela.com

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. [1]

A 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. [1]

Relations

related
FlashStore, SILT, FAWN-DS, Bloom filter, Read amplification

Citations

  1. 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. (accessed 2026-11-14)
Sources & caveats
  • Historical primary-source review. The linked directory calculation is arithmetic, not a SkimpyStash reproduction.

JSON: /data/terms/skimpystash.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. SkimpyStash. Hesela. 2026-11-14. https://hesela.dev/terms/skimpystash/