Cache Breakdown
Updated 2026-08-09
INTRODUCTION
English translation pending.
CORE DEFINITION
In caching systems, breakdown describes the failure that follows the expiry of one heavily requested key, such as a popular product page during a sale. Because the key is hot, all concurrent requests miss the cache at the same instant and pass through to the backing database, whose capacity was never sized for that load. It is distinct from cache avalanche, where many keys expire together, and from penetration, where requests target keys that never existed.
SCAFFOLDING EFFECT
Reduce cognitive load
- Protect the hot key: give the most critical dependency a policy that never expires or refreshes early. - Stage the rebuild: let one request refill the value while others wait or receive stale data. - Audit single dependencies: list what would break if one key, person or client vanished at once.
Anchor fast decisions
A cache serves most requests without touching the database, so the database is sized for the miss rate rather than the full request rate. When the hot key expires, every concurrent request misses simultaneously, and the full load arrives at the database in one burst. The database saturates, and its failure removes the last layer of protection.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Cache_stampedeverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS