article

Free access

Reciprocal hashing: a method for generating minimal perfect hashing functions

Author:

G. JaeschkeAuthors Info & Claims

Communications of the ACM, Volume 24, Issue 12

Pages 829 - 833

https://doi.org/10.1145/358800.358806

Published: 01 December 1981 Publication History

PDF eReader

Abstract

A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given. Two algorithms for determining hash functions of reciprocal type are presented and their practical limitations are discussed. Further, some application results are given and compared with those of earlier approaches for perfect hashing.

References

[1]

Cichelli, R.J. Minimal perfect hash functions made simple. Comm. ACM, 23, 1 (Jan. 1980), 17-19.

Digital Library

Google Scholar

[2]

Greniewski, M., and Turski, W. The external language KLIPA for the URAL-2 digital computer. Comm. ACM, 6, 6 (June 1963), 322- 324.

Digital Library

Google Scholar

[3]

Jaeschke, G. Minimal perfect hashing. Tech. Rept. TR 80.02.003, IBM Heidelberg Scientific Center, Niederlassung Heidelberg, Germany.

Google Scholar

[4]

Jaeschke, G., Osterburg, G. On Cichelli's minimal perfect hash functions method. Comm. ACM, 23, 12 (Dec. 1980), 728-729.

Google Scholar

[5]

Knott, G.D. Hashing functions. Computer J., 18 (Aug. 1975), 265-278.

Crossref

Google Scholar

[6]

Leveque, W. J. Topics in Number Theory. Addison-Wesley, Reading, Mass., 1956.

Google Scholar

[7]

Sprugnoli, R. Perfect hashing functions: a single probe retrieving method for static sets. Comm. ACM, 20, 11 (Nov. 1977), 841-850.

Digital Library

Google Scholar

Cited By

View all

Darivandpour JLe DAtallah M(2021)Secure two-party input-size reduction: Challenges, solutions and applicationsInformation Sciences10.1016/j.ins.2021.01.038567(256-277)Online publication date: Aug-2021
https://doi.org/10.1016/j.ins.2021.01.038
Buckley LByrne JMoloney D(2018)Investigating the Impact of Suboptimal Hashing Functions2018 IEEE Games, Entertainment, Media Conference (GEM)10.1109/GEM.2018.8516265(324-331)Online publication date: Aug-2018
https://doi.org/10.1109/GEM.2018.8516265
Blasius A(2018)Generating a Rotation Reduction Perfect Hashing FunctionMathematics Magazine10.1080/0025570X.1995.1199627168:1(35-41)Online publication date: 11-Apr-2018
https://doi.org/10.1080/0025570X.1995.11996271
Show More Cited By

Index Terms

Reciprocal hashing: a method for generating minimal perfect hashing functions

Recommendations

Perfect hashing functions: a single probe retrieving method for static sets

A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of identifiers, two methods are presented for building, in a mechanical way, perfect hashing functions, i.e. functions ...
Minimal perfect hash functions made simple

A method is presented for computing machine independent, minimal perfect hash functions of the form: hash value ← key length + the associated value of the key's first character + the associated value of the key's last character. Such functions allow ...
Minimal perfect hashing: A competitive method for indexing internal memory

A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values. Since no collisions occur, each key can be retrieved from a hash table with a single probe. A minimal perfect hash function (MPHF) is a PHF with the ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 24, Issue 12

Dec. 1981

45 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/358800

Editor:
Robert L. Ashenhurst
The Univ. of Chicago, Chicago, IL

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 December 1981

Published in CACM Volume 24, Issue 12

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

71
Total Citations
View Citations
925
Total Downloads

Downloads (Last 12 months)92
Downloads (Last 6 weeks)14

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Darivandpour JLe DAtallah M(2021)Secure two-party input-size reduction: Challenges, solutions and applicationsInformation Sciences10.1016/j.ins.2021.01.038567(256-277)Online publication date: Aug-2021
https://doi.org/10.1016/j.ins.2021.01.038
Buckley LByrne JMoloney D(2018)Investigating the Impact of Suboptimal Hashing Functions2018 IEEE Games, Entertainment, Media Conference (GEM)10.1109/GEM.2018.8516265(324-331)Online publication date: Aug-2018
https://doi.org/10.1109/GEM.2018.8516265
Blasius A(2018)Generating a Rotation Reduction Perfect Hashing FunctionMathematics Magazine10.1080/0025570X.1995.1199627168:1(35-41)Online publication date: 11-Apr-2018
https://doi.org/10.1080/0025570X.1995.11996271
Jan JChang C(2011)Addressing for letter‐oriented keysJournal of the Chinese Institute of Engineers10.1080/02533839.1988.967706711:3(279-284)Online publication date: 4-May-2011
https://doi.org/10.1080/02533839.1988.9677067
Chang CShieh J(2011)On the design of letter oriented minimal perfect hashing functionsJournal of the Chinese Institute of Engineers10.1080/02533839.1985.96768328:3(285-297)Online publication date: 4-May-2011
https://doi.org/10.1080/02533839.1985.9676832
Farshi MGudmundsson J(2010)Experimental study of geometric t-spannersACM Journal of Experimental Algorithmics10.1145/1498698.156449914(1.3-1.39)Online publication date: 5-Jan-2010
https://dl.acm.org/doi/10.1145/1498698.1564499
Chang PKim WChoi HWon D(2009)An efficient hash-based searching for specimens in the museum's exhibitProceedings of the 3rd International Conference on Ubiquitous Information Management and Communication10.1145/1516241.1516251(45-50)Online publication date: 15-Feb-2009
https://dl.acm.org/doi/10.1145/1516241.1516251
Tyystjarvi JSantti TPlosila J(2009)Efficient execution of switch instructions on a multicore Java co-processor system2009 International Conference for Technical Postgraduates (TECHPOS)10.1109/TECHPOS.2009.5412073(1-5)Online publication date: Dec-2009
https://doi.org/10.1109/TECHPOS.2009.5412073
Daoud AMitra PGiles CCarr L(2007)Perfect hash functions for large dictionariesProceedings of the ACM first workshop on CyberInfrastructure: information management in eScience10.1145/1317353.1317368(67-72)Online publication date: 9-Nov-2007
https://dl.acm.org/doi/10.1145/1317353.1317368
Aoe J(2007)A fast digital search algorithm using a double‐array structureSystems and Computers in Japan10.1002/scj.469020071020:7(92-103)Online publication date: 21-Mar-2007
https://doi.org/10.1002/scj.4690200710
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

Index Terms

Recommendations

Perfect hashing functions: a single probe retrieving method for static sets

Minimal perfect hash functions made simple

Minimal perfect hashing: A competitive method for indexing internal memory

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