Space/Time Trade-offs in Hash Coding with Allowable Errors (1970) [825 citations — 0 self]
by
Burton H. Bloom
Communications of the ACM
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Bloom70space/timetrade-offs,
author = {Burton H. Bloom},
title = {Space/Time Trade-offs in Hash Coding with Allowable Errors},
journal = {Communications of the ACM},
year = {1970},
volume = {13},
pages = {422--426}
}
author = {Burton H. Bloom},
title = {Space/Time Trade-offs in Hash Coding with Allowable Errors},
journal = {Communications of the ACM},
year = {1970},
volume = {13},
pages = {422--426}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency
Citations
| 23 | Scatter Storage Techniques – Morris - 1968 |
| 3 | An improved hash code for scatter storage – MAURER - 1968 |
| 1 | The organization of symbol tables – BATSON - 1965 |
