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

  title={Space/time trade-offs in hash coding with allowable errors},
  author={Burton H. Bloom},
  journal={Commun. ACM},
  • B. Bloom
  • Published 1 July 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…

Tables from this paper

Bloom filters and their applications
The bloom filters, as a new approach to hashing, were firstly presented by Burton Bloom by giving the definition of Bloom filter and comparing this method with the previous one and the main advantages of new concept are presented.
On Randomness in Hash Functions
Quality measures for hash functions used in data structures and algorithms are discussed, positive and negative results are surveyed, and research into the question of just how much independence in the hash functions is necessary for an algorithm to work is invited.
Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design
The vector quotient filter is presented, which is based on Robin Hood hashing, but uses power-of-two-choices hashing to reduce the variance of runs, and thus offers consistent, high throughput across load factors.
On the optimal time/space tradeoff for hash tables
This paper obtains a constant-time dynamic filter that uses n ⌈logє−1 ⌉+ n loge + o(n) bits of space for a wide choice of false-positive rates є, resolving a long-standing open problem for the design of dynamic filters.
Optimal compression of hash-origin prefix trees
The informational content of such general task and how to practically approach such found lower boundaries and asymptotic case can be also seen as a way to optimally encode n large unordered numbers - saving lg(n!) bits of information about their ordering, which can be the major part of contained information.
On the Use of (Non-)Cryptographic Hashes on FPGAs
It is demonstrated that even small flaws in the avalanche effect of a hash function induce significant deviation from a uniform distribution in such sub-hashes, which allows potential denial-of-service attacks.
Evolutionary hash functions for specific domains
Hash-based data structures for extreme conditions
It is shown that a wide class of Bloom filter variants can be effectively implemented using very easily computable combinations of only two fully random hash functions, and that Bloom filters and related data structures can often be substantially derandomized with essentially no loss in performance.
Efficient hash tables for network applications
The design makes efficient hash table implementations cheaper, more predictable, and more practical, and reduces the requirement of on-chip memory up to an order of magnitude and guarantees constant lookup and update time at the cost of only minute amounts of additional hardware.
Exploiting Degrees of Freedom for Efficient Hashing in Network Applications
The design makes fast hash table implementations cheaper, more predictable and above all, more practicaL the requirement of on-chip memory up to an order of magnitude at the cost of only minute amounts of additional hardware.


Programming Technique: An improved hash code for scatter storage
A new hash coding method is presented that, besides being very simple and as fast as the best known methods, allows the table size to be almost any prime number.
The organization of symbol tables
An efficient symbol table organization is an important feature in the design of any compiler. During lhe construction of the Virginia ALGOL 60 compiler for the Burroughs B205, the primary