Summary cache¶
Fan, L. (2000). Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Transactions on Networking.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Bloom Filter
- Standard Bloom filters do not support deletion (clearing a bit would risk converting true positives to false negatives); counting Bloom filters extend the design by replacing bits with small counters to support deletion, at proportional space cost.
This sourceThe counting Bloom filter, storing a small counter (4 bits) at each bit position so entries can be deleted by decrementing, at a proportional space cost. A web-cache-sharing protocol in which each proxy advertises a compact summary of its cache and checks a peer's summary locally for a potential hit before querying.
Supported in partVerified against a saved copy of the source
“the counts c(h1(a)), c(h2(a)), ..., c(hk(a)) are incremented or decremented accordingly”
- Standard Bloom filters do not support deletion (clearing a bit would risk converting true positives to false negatives); counting Bloom filters extend the design by replacing bits with small counters to support deletion, at proportional space cost.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
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.
Registry ID ref:9ea1fdaf7655 · see in the full table