Optimal Probabilistic Cache Stampede Prevention

Vattani, A., Chierichetti, F., & Lowenstein, K. (2015). Optimal Probabilistic Cache Stampede Prevention. Proceedings of the VLDB Endowment, 8(8), 886-897.

Type

Journal article

Intellectual base

Primary research

Year

2015

Volume

8

Issue

8

Pages

886-897

DOI

10.14778/2757807.2757813

DOI registrant

Association for Computing Machinery

Link

https://www.vldb.org/pvldb/vol8/p886-vattani.pdf

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Mechanisms

• Cache Warming
  • Warming the shared hot set ahead of time prevents a cache stampede from converging on the origin at once.

    This sourceShows that recomputing popular cached items before expiry can prevent simultaneous misses from overwhelming the backend.

• Single-Flight Request Coalescing
  • A breaking story sends traffic spiking, and at the instant the key expires, roughly 8,000 in-flight requests all miss simultaneously and — without coordination — all issue the same heavy database aggregation at once, a cache stampede that can topple the origin just as demand peaks.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://doi.org/10.14778/2757807.2757813 ×2

Registry ID ref:c982e594f8a1 · see in the full table