Network Applications of Bloom Filters

Broder, A., & Mitzenmacher, M. (2004). Network Applications of Bloom Filters: A Survey. Internet Mathematics, 1(4), 485-509.

Type

Journal article

Intellectual base

Primary research

Year

2004

DOI

10.1080/15427951.2004.10129096

Link

https://doi.org/10.1080/15427951.2004.10129096

Cited from

computer_science

Cited by

1 citation across 1 artifact.

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

Primes

• Asymmetric Screening
  • along with spam quarantine queues, branch prediction with rollback, hash-based deduplication front-ends, tiered cache lookups, and approximate-nearest-neighbour search before exact rerank.

    This sourceSurveys Bloom-filter applications as cheap front-ends gating expensive lookups and gives the false-positive probability as a function of array size and hash count.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d12d458bf981 · see in the full table