Space/Time Trade-offs in Hash Coding with Allowable Errors.

Bloom, B. H. (1970). Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 13(7), 422-426.

Type

Journal article

Intellectual base

Primary research

Year

1970

DOI

10.1145/362686.362692

Link

https://doi.org/10.1145/362686.362692

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
  • In computer science it is the Bloom filter and the Cuckoo filter — the canonical case, where false positives are allowed but false negatives are impossible by construction

    This sourceIntroduces the Bloom filter, whose construction makes false negatives impossible while admitting tunable false positives — a provably one-sided-error cheap filter.

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:6466e13e291f · see in the full table