Space/time trade-offs in hash coding with allowable errors

@article{Bloom1970SpacetimeTI,
  title={Space/time trade-offs in hash coding with allowable errors},
  author={B. Bloom},
  journal={Commun. ACM},
  year={1970},
  volume={13},
  pages={422-426}
}
  • B. Bloom
  • Published 1970
  • Computer Science
  • Commun. ACM
In this paper trade-offs among certain computational factors in hash coding are analyzed. [...] Key MethodThe new methods are intended to reduce the amount of space required to contain the hash-coded information from that associated with conventional methods. The reduction in space is accomplished by exploiting the possibility that a small fraction of errors of commission may be tolerable in some applications, in particular, applications in which a large amount of data is involved and a core resident hash area…Expand
6,777 Citations
Optimal compression of hash-origin prefix trees
  • J. Duda
  • Mathematics, Computer Science
  • ArXiv
  • 2012
  • PDF
On Randomness in Hash Functions
  • 3
  • PDF
Evolutionary hash functions for specific domains
  • 4
Efficient hash tables for network applications
  • 5
Exploiting Degrees of Freedom for Efficient Hashing in Network Applications
  • 1
Practical use of Approximate Hash Based Matching in digital investigations
  • 10
  • PDF
A Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives
  • 19
  • PDF
...
1
2
3
4
5
...