Bloom: space-time trade-offs in hash coding with allowable errors

What changed

Analyzed approximate membership structures that reduce storage by allowing bounded false-positive membership errors, including the bit-array method now associated with Bloom filters.

Scientific scope

The record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.

Contributors

• Burton H. Bloom · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• Princeton-hosted copy of Bloom hash-coding paper
• Crossref record for Bloom hash-coding paper

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction