article

Free access

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

Author:

Burton H. BloomAuthors Info & Claims

Communications of the ACM, Volume 13, Issue 7

Pages 422 - 426

https://doi.org/10.1145/362686.362692

Published: 01 July 1970 Publication History

PDF eReader

Abstract

In 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.

The 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 is consequently not feasible using conventional methods.

In such applications, it is envisaged that overall performance could be improved by using a smaller core resident hash area in conjunction with the new methods and, when necessary, by using some secondary and perhaps time-consuming test to “catch” the small fraction of errors associated with the new methods. An example is discussed which illustrates possible areas of application for the new methods.

Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.

References

[1]

BATSON, A. The organization of symbol tables. Comm. ACM 8, 2 (Feb. 1965), 111-112.

Digital Library

Google Scholar

[2]

MAURER, W. D. An improved hash code for scatter storage. Comm. ACM 11, 1 (Jan. 1968), 35-38.

Digital Library

Google Scholar

[3]

MORRIS, R. Scatter storage techniques. Comm. ACM 11, 1 (Jan. 1968), 38-44.

Digital Library

Google Scholar

Cited By

View all

Ren YRen YLi XHu YLi JLee PMa XWon Y(2024)ELECTProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650715(293-310)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650715
Zhu ZZhao YLiu ZMa XWon Y(2024)In-memory key-value store live migration with NetMigrateProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650710(209-224)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650710
Mei ZHuang JWu BZhang CZou HShi JCheng Z(2024)A Secure and Fast Range Query Scheme for Encrypted Multi-Dimensional DataInternational Journal of Web Services Research10.4018/IJWSR.34039121:1(1-17)Online publication date: 9-Apr-2024
https://dl.acm.org/doi/10.4018/IJWSR.340391
Show More Cited By

Recommendations

The use of quadratic residue research

Some of the problems of simulating discrete event systems, particularly computer systems, on a conventional digital computer are dealt with. The systems are assumed to be described as a network of interconnected sequential processes. Briefly reviewed ...
Read More
Scatter storage techniques
Special 25th Anniversary Issue
Read More
Scatter storage techniques
Read More

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 13, Issue 7

July 1970

70 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/362686

Editor:
M. Stuart Lynn
IBM Scientific Center, Houston, TX

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1970

Published in CACM Volume 13, Issue 7

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5,744
Total Citations
View Citations
17,987
Total Downloads

Downloads (Last 12 months)3,049
Downloads (Last 6 weeks)238

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ren YRen YLi XHu YLi JLee PMa XWon Y(2024)ELECTProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650715(293-310)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650715
Zhu ZZhao YLiu ZMa XWon Y(2024)In-memory key-value store live migration with NetMigrateProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650710(209-224)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650710
Mei ZHuang JWu BZhang CZou HShi JCheng Z(2024)A Secure and Fast Range Query Scheme for Encrypted Multi-Dimensional DataInternational Journal of Web Services Research10.4018/IJWSR.34039121:1(1-17)Online publication date: 9-Apr-2024
https://dl.acm.org/doi/10.4018/IJWSR.340391
Lin WMa JLi TYe HZhang JXiao Y(2024)CrptAC: Find the Attack Chain with Multiple Encrypted System LogsElectronics10.3390/electronics1307137813:7(1378)Online publication date: 5-Apr-2024
https://doi.org/10.3390/electronics13071378
Jiang YRezazadeh Baee MSimpson LGauravaram PPieprzyk JZia TZhao ZLe Z(2024)Pervasive User Data Collection from Cyberspace: Privacy Concerns and CountermeasuresCryptography10.3390/cryptography80100058:1(5)Online publication date: 31-Jan-2024
https://doi.org/10.3390/cryptography8010005
Jay Dave Nikumani Choudhury (2024)Secure and Efficient Traffic Obfuscation Scheme for Deduplicated Cloud StorageAutomatic Control and Computer Sciences10.3103/S014641162470005658:2(153-165)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.3103/S0146411624700056
Bay A(2024)NEW THRESHOLD PRIVATE SET INTERSECTION PROTOCOLSMugla Journal of Science and Technology10.22531/muglajsci.1387499Online publication date: 4-Apr-2024
https://doi.org/10.22531/muglajsci.1387499
Pham DPhan V(2024)MetaBIDx: a new computational approach to bacteria identification in microbiomesMicrobiome Research Reports10.20517/mrr.2024.013:2Online publication date: 1-Apr-2024
https://doi.org/10.20517/mrr.2024.01
Chen GHe ZLi MLuo S(2024)Oasis: An Optimal Disjoint Segmented Learned Range FilterProceedings of the VLDB Endowment10.14778/3659437.365944717:8(1911-1924)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659447
Malchiodi DRaimondi DFumagalli GGiancarlo RFrasca M(2024)The role of classifiers and data complexity in learned Bloom filters: insights and recommendationsJournal of Big Data10.1186/s40537-024-00906-911:1Online publication date: 27-Mar-2024
https://doi.org/10.1186/s40537-024-00906-9
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

The use of quadratic residue research

Scatter storage techniques

Scatter storage techniques

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations