{
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "slug": "cache-stampede",
  "term": "Cache stampede",
  "aliases": [
    "Cache miss storm",
    "Dog-piling"
  ],
  "definition": "A cache stampede occurs when overlapping requests for one unavailable cached value independently start redundant work to reconstruct it.",
  "note": "Triggers: Expiration, eviction or invalidation can expose a hot key to concurrent misses. A high aggregate hit ratio does not describe the concentration of backend work around that event. [xfetch-paper]\n\nCoordination: A key-bound refill token can authorize cache publication and reject a stale fill after invalidation. Regulating token issuance also suppresses repeated backend fetches. Serving an older value is a separate application freshness decision. [memcache-paper]",
  "related": [
    "xfetch",
    "request-coalescing",
    "delayed-hit",
    "segcache"
  ],
  "citations": [
    {
      "id": "xfetch-paper",
      "title": "Vattani, Chierichetti and Lowenstein. Optimal Probabilistic Cache Stampede Prevention. PVLDB 8(8), 886-897 (2015), sections 2-5.",
      "url": "https://cseweb.ucsd.edu/~avattani/papers/cache_stampede.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "memcache-paper",
      "title": "Nishtala et al. Scaling Memcache at Facebook. NSDI 2013, pp. 385-398, section 3.2.1.",
      "url": "https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final170_update.pdf",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "Primary-source review, not a reproduction of the systems' throughput or workload measurements."
  ]
}
