article

Free access

Practical minimal perfect hash functions for large databases

Authors:

Edward A. Fox,

Lenwood S. Heath,

Qi Fan Chen,

Amjad M. DaoudAuthors Info & Claims

Communications of the ACM, Volume 35, Issue 1

Pages 105 - 121

https://doi.org/10.1145/129617.129623

Published: 02 January 1992 Publication History

PDF eReader

References

[1]

Brain, M.D., and Tharp, A.L. Nearperfect hashing of large word sets. Softw.--Prac. Exp. t 9, 10 (1989), 967- 978.

Digital Library

Google Scholar

[2]

Carter, J.L., and Wegman, M.N. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2 (1979), 143- 154.

Crossref

Google Scholar

[3]

Cercone, N., Krause, M., and Boates, J. Minimal and almost minimal perfect hash function search with application to natural language lexicon design. Comput. Math. Appli. 9, 1 (1983), 215-23t.

Crossref

Google Scholar

[4]

Chang, C.C. The study of an ordered minimal perfect hashing scheme. ACM 27, 4 (1984), 384-387.

Digital Library

Google Scholar

[5]

Chang, C.C. Letter-oriented reciprocal hashing scheme. Inf. Sci. 38, 3 (1986), 243-255.

Digital Library

Google Scholar

[6]

Ciche!!i, R.J. Minimal perfect hash functions made simple, Commun. ACM 23, t (1980), 17-19.

Digital Library

Google Scholar

[7]

Cormack, G.V., Horspool, R.N.S., and Kaiserswerth, M. Practical perfect hashing. The Comput. J. 28, t (1985), 54-58.

Google Scholar

[8]

Daoud, A.M. Efficient data structures for information retrieval systems. Dissertation proposal, Department of Computer Science, Virginia Polytechnic Institute and State University, July, 1990.

Digital Library

Google Scholar

[9]

Datta, S. Implementation of a perfect hash function scheme. Master's report, Dept. of Computer Science, Virginia Polytechnic Institute and State University, 1988. Available as Tech. Rep. TR-89-9.

Digital Library

Google Scholar

[10]

Enbody, R.J., and Du, H.C. Dynamic hashing schemes. ACM Cornput. Surv. 20, 2 (1988), 85-113.

Digital Library

Google Scholar

[11]

Fctler, W. An Introduction to Probability Theory and its Applications, Vol. t. John Wile}.' and Suns, N.Y., 1968.

Google Scholar

[12]

Fox, E.A. Optical disks and CD- R()M' Publishing and access, in Annual Review of Information Science and Technoto~, Martha E. Williams, Ed. ASIS/E!sevier Scicnce Publishers B.V., Amsterdam, Vol. 23, 1988, 85-124.

Google Scholar

[13]

F~x, F.A. Virginia Disc One. CD- ROM dcvcloped at Virginia Polytechnic institute and State University, published by VPI&SU Press, and produced by Nimbus Records, Ruckersville, Va, 1990.

Google Scholar

[14]

Fox E.A. Chen Q.m, Daoud A.M. and Heath, I,. Order-preservini~ minimal perfect hash functions and inf()rmation retrieval, In proceedings of SIGIR '90. 13th international Conferences on R & D in information Retrieval (Brussels, Belgium. Sept. 1990) 279-311

Digital Library

Google Scholar

[15]

Fox E. A., Chen Q., Daoud A. M. and Heath L. Order preserving minimal perfect hash functions and infromation retrieval, ACM Trans. Infi Syst. 9, 2 ( 1991).

Digital Library

Google Scholar

[16]

Fox, E.A., Chert, Q., Heath, i. and Datta, S. A more cost-effective algorithm for finding perfect hash functions. In Proceedings of the Seventeenth Annual ACM Computer Science Conference (Louisville, Ky, Feb. Inf. syst. 9,2 (1991).

Digital Library

Google Scholar

[17]

Fox, E.A., (;hen, Q., and Hcat}~, L. An ()(n log n) algorithm fbr tinding minimal perfect hash functions. Tech. Rep. 89-10, Dept. of' Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, Va, 1989.

Digital Library

Google Scholar

[18]

Fox, E.A., Nutter, .I.'1' Ahiswede, T., Evens, M. and Markowitz, {.

Google Scholar

[19]

Fox, E., Wohlwend, R., Sheldon, P., (:;hen, Q. and France, R. Building the CODER lexicon' The Collins English Dictionary and its adverb definitions. 'l'ech. Rcp. '1'R-86-23, Dept. of (;omputer Science, Virginia Polytechnic Institute and State University, Oct. 1986.

Digital Library

Google Scholar

[20]

Fredman M.L. komlos J and Szemeredi E. Storing a sparse table with O(I) worst-case acess time. J. Acm 31 3 (1984) 588-544.

Digital Library

Google Scholar

[21]

Gonnet G.L. and latsore P. Exter nal instalingf with limited internal storage JK.

Google Scholar

[22]

Hanks P. ed. Collins English Dictionary. William Collings and Co. London, 1979.

Google Scholar

[23]

jaeschke, G. Reciprocal hasi~ing--a method tbr generating minimal perfect hash functions. Commun. ACM 24, 12 (1981), 829-833.

Digital Library

Google Scholar

[24]

Knuth, D.E. 7'he Art o/Computer Programming, Vol. 3, Sorting and Searching. Addison-Wesley Publist~ing Co., Reading, Mass., 1973.

Digital Library

Google Scholar

[25]

Mairson, H.G. 'l'hc program complexity of searching a table. In Proceedi.ngs of' the 24th fEEE Symposium on Foundations of Computer Science (Tucson, Ariz., Nov. 7-9), 1983, 40-47.

Google Scholar

[26]

Mchlhorn, K. On the program size of perfect and universal hash functions, tn Proceedings of the 23d IEEE Symposium on Foundations of Computer Science (Chicago, I11. Nov. 3-5, 1982), 170-175.

Google Scholar

[27]

Palmer, E.M. Graphical Evotutwn: An Introduction to the Theo~' of Random Graphs. John %riley & Sons, N.Y., 1985.

Digital Library

Google Scholar

[28]

Park, S.K. and Miller, K.W. Random number generators: Good ones are hard to lind. Commun. ACM 31, f0 (1988), 1 t92-1201.

Digital Library

Google Scholar

[29]

Pearson, P.K. Fast hashing of' variable-length text strings. Commun. ACM 33, 6 (1990), 677-680.

Digital Library

Google Scholar

[30]

Ramakrishna, M.V. and Larson, P. files organization using composite perfect hashing ACM Trans Data basic syst 14.12 (1980) 231-263.

Digital Library

Google Scholar

[31]

Sagar J. A new method for gen creating minimal perfect hashing funcations fedss rep Dept of computer sciences univer versity ofMissouri rolla Mo 1981.

Google Scholar

[32]

Sagar J. polynomial some gen erations for mimmal perfect lands funcations comman ACAL 28. (1985) 523-532.

Digital Library

Google Scholar

[33]

Sagar J. A polynom A. On aspects of universality and perforinance tot closed hashing. In Proceedings' o/ tf~e 2 l st ACM 5}~mposium on Theo0' of Computing (Seattle, Waste., May 15-t7, 1989), 355-366.

Digital Library

Google Scholar

[34]

Sedgewick, R. Algorithms. Addison- Wesley Publishing Co., Reading, Mass,. 1988.

Digital Library

Google Scholar

[35]

Sprugnoli, R. Pertect hashing t'unctions: A single probe retrieving method fbr static sets. Commun. ACM 20, tt (1977), 841-850.

Digital Library

Google Scholar

Cited By

View all

Niu YWei XLi J(2022)Fast and Robust Star Identification Using Color Ratio InformationIEEE Sensors Journal10.1109/JSEN.2022.320610322:21(20401-20412)Online publication date: 1-Nov-2022
https://doi.org/10.1109/JSEN.2022.3206103
Sandnes F(2021)HIDE: Short IDs for Robust and Anonymous Linking of Users Across Multiple Sessions in Small HCI ExperimentsExtended Abstracts of the 2021 CHI Conference on Human Factors in Computing Systems10.1145/3411763.3451794(1-6)Online publication date: 8-May-2021
https://dl.acm.org/doi/10.1145/3411763.3451794
Li JWei XWang GZhou S(2020)Improved Grid Algorithm Based on Star Pair Pattern and Two-dimensional Angular Distances for Full-Sky Star IdentificationIEEE Access10.1109/ACCESS.2019.29612718(1010-1020)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2019.2961271
Show More Cited By

Index Terms

Practical minimal perfect hash functions for large databases
1. Information systems
  1. Data management systems
    1. Data structures
      1. Data access methods
  2. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Hashed file organization

Recommendations

The Study of a New Perfect Hash Scheme

A new approach is proposed for the design of perfect hash functions. The algorithms developed can be effectively applied to key sets of large size. The basic ideas employed in the construction are rehash and segmentation. Analytic results are given ...
Finding Minimal Perfect Hash Functions
Practical perfect hashing in nearly optimal space

A hash function is a mapping from a key universe U to a range of integers, i.e., h:U@?{0,1,...,m-1}, where m is the range's size. A perfect hash function for some set S@?U is a hash function that is one-to-one on S, where m>=|S|. A minimal perfect hash ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 35, Issue 1

Jan. 1992

129 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/129617

Editor:
Peter Denning
NASA Ames Research Center, Moffett Field, CA

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: 02 January 1992

Published in CACM Volume 35, Issue 1

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

75
Total Citations
View Citations
2,653
Total Downloads

Downloads (Last 12 months)330
Downloads (Last 6 weeks)70

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Niu YWei XLi J(2022)Fast and Robust Star Identification Using Color Ratio InformationIEEE Sensors Journal10.1109/JSEN.2022.320610322:21(20401-20412)Online publication date: 1-Nov-2022
https://doi.org/10.1109/JSEN.2022.3206103
Sandnes F(2021)HIDE: Short IDs for Robust and Anonymous Linking of Users Across Multiple Sessions in Small HCI ExperimentsExtended Abstracts of the 2021 CHI Conference on Human Factors in Computing Systems10.1145/3411763.3451794(1-6)Online publication date: 8-May-2021
https://dl.acm.org/doi/10.1145/3411763.3451794
Li JWei XWang GZhou S(2020)Improved Grid Algorithm Based on Star Pair Pattern and Two-dimensional Angular Distances for Full-Sky Star IdentificationIEEE Access10.1109/ACCESS.2019.29612718(1010-1020)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2019.2961271
Giudici AKalda JSoomere T(2019)Generation of large pollution patches via collisions of sticky floating parcels driven by wind and surface currentsMarine Pollution Bulletin10.1016/j.marpolbul.2019.02.039141(573-585)Online publication date: Apr-2019
https://doi.org/10.1016/j.marpolbul.2019.02.039
Wang GLi JWei X(2018)Star Identification Based on Hash MapIEEE Sensors Journal10.1109/JSEN.2017.277227218:4(1591-1599)Online publication date: 15-Feb-2018
https://doi.org/10.1109/JSEN.2017.2772272
Duan WLuo JNi GTang BHu QGao Y(2018)Exclusive grouped spatial hashingComputers & Graphics10.1016/j.cag.2017.08.01270(71-79)Online publication date: Feb-2018
https://doi.org/10.1016/j.cag.2017.08.012
Shan JZhang YJiang MJin CZhang Z(2018)A Fast PQ Hash Code IndexingInnovative Mobile and Internet Services in Ubiquitous Computing10.1007/978-3-319-93554-6_37(395-402)Online publication date: 8-Jun-2018
https://doi.org/10.1007/978-3-319-93554-6_37
Szmit R(2017)Fast Plagiarism Detection in Large-Scale DataBeyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation10.1007/978-3-319-58274-0_27(329-343)Online publication date: 27-Apr-2017
https://doi.org/10.1007/978-3-319-58274-0_27
Binder NKeller ALuebke DMolnar S(2016)Efficient stackless hierarchy traversal on GPUs with backtracking in constant timeProceedings of High Performance Graphics10.5555/2977336.2977343(41-50)Online publication date: 20-Jun-2016
https://dl.acm.org/doi/10.5555/2977336.2977343
Matsunaga YFettweis GNebel W(2014)Synthesis algorithm of parallel index generation unitsProceedings of the conference on Design, Automation & Test in Europe10.5555/2616606.2617037(1-6)Online publication date: 24-Mar-2014
https://dl.acm.org/doi/10.5555/2616606.2617037
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.

References

Cited By

Index Terms

Recommendations

The Study of a New Perfect Hash Scheme

Finding Minimal Perfect Hash Functions

Practical perfect hashing in nearly optimal space

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