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

DMCA

Space/Time Trade-offs in Hash Coding with Allowable Errors (1970)

Cached

Download Links

Other Repositories/Bibliography

CiteULike
DBLP

by Burton H. Bloom

Venue:	Communications of the ACM
Citations:	2082 - 0 self

BibTeX

@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}
}

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

Keyphrases

hash coding space time trade-off allowable error paper trade-off hash area new hash coding method paradigm problem certain computational factor computational factor reject time particular conventional hash-coding method allowable error frequency

DMCA