Article

Efficient Minimal Perfect Hashing in Nearly Minimal Space

Authors:

Torben Hagerup,

Torsten TholeyAuthors Info & Claims

STACS '01: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science

Pages 317 - 326

Published: 15 February 2001 Publication History

Abstract

We consider the following problem: Given a subset S of size n of a universe {0,..., u-1}, construct a minimal perfect hash function for S, i.e., a bijection h from S to {0,..., n - 1}. The parameters of interest are the space needed to store h, its evaluation time, and the time required to compute h from S. The number of bits needed for the representation of h, ignoring the other parameters, has been thoroughly studied and is known to be n log e + loglog u ± O(log n), where "log" denotes the binary logarithm. A construction by Schmidt and Siegel uses O(n + loglogu) bits and offers constant evaluation time, but the time to find h is not discussed. We present a simple randomized scheme that uses n log e+log log u+o(n+log log u) bits and has constant evaluation time and O(n + log log u) expected construction time.

References

[1]

J. L. Carter and M. N. Wegman, Universal Classes of Hash Functions, J. Comput. System Sci. 18 (1979), pp. 143-154.

Google Scholar

[2]

M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, Proc. 17th International Colloquium on Automata, Languages and Programming (ICALP 1990), Lecture Notes in Computer Science, Vol. 443, Springer-Verlag, Berlin, pp. 6-19.

Crossref

Google Scholar

[3]

M. L. Fredman and J. Komlós, On the size of separating systems and families of perfect hash functions, SIAM J. Alg. Disc. Meth. 5 (1984), pp. 61-68.

Google Scholar

[4]

M. L. Fredman, J. Komlós and E. SzemerÉdi, Storing a sparse table with O(1) worst case access time, J. ACM 31 (1984), pp. 538-544.

Crossref

Google Scholar

[5]

T. Hagerup, Sorting and searching on the word RAM, Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science, Vol. 1373, Springer-Verlag, Berlin, pp. 366-398.

Crossref

Google Scholar

[6]

M. Hofri, Probabilistic Analysis of Algorithms, Springer-Verlag, New York, 1987.

Google Scholar

[7]

C. P. Kruskal, L. Rudolph and M. Snir, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci. 71, (1990), pp. 95-132.

Crossref

Google Scholar

[8]

K. Mehlhorn, Data Structures and Algorithms, Vol. 1: Sorting and Searching, Springer-Verlag, Berlin, 1984.

Crossref

Google Scholar

[9]

M. O. Rabin, Probabilistic algorithm for testing primality. J. Number Theory 12, (1980), pp. 128-138.

Google Scholar

[10]

J. Radhakrishnan, Improved bounds for covering complete uniform hypergraphs, Inform. Process. Lett. 41 (1992), pp. 203-207.

Crossref

Google Scholar

[11]

J. P. Schmidt and A. Siegel, The spatial complexity of oblivious k-probe hash functions, SIAM J. Comput. 19 (1990), pp. 775-786.

Crossref

Google Scholar

[12]

A. Siegel, On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, Proc. 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1989), pp. 20-25.

Crossref

Google Scholar

Cited By

View all

Aamand AKnudsen JKnudsen MRasmussen PThorup MMakarychev KMakarychev YTulsiani MKamath GChuzhoy J(2020)Fast hashing with strong concentration boundsProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384259(1265-1278)Online publication date: 22-Jun-2020
https://dl.acm.org/doi/10.1145/3357713.3384259
Kleindessner MVon Luxburg U(2017)Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysisThe Journal of Machine Learning Research10.5555/3122009.315301418:1(1889-1940)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3122009.3153014
Belazzougui DVenturini R(2016)Compressed String Dictionary Search with Edit Distance OneAlgorithmica10.1007/s00453-015-9990-074:3(1099-1122)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1007/s00453-015-9990-0
Show More Cited By

Index Terms

Efficient Minimal Perfect Hashing in Nearly Minimal Space
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Hashed file organization

Index terms have been assigned to the content through auto-classification.

Recommendations

Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms

A minimal perfect hash function maps a set S of n keys into the set {0, 1,..., n -- 1} bijectively. Classical results state that minimal perfect hashing is possible in constant time using a structure occupying space close to the lower bound of log e ...
Simple Minimal Perfect Hashing in Less Space
ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms

A minimal perfect hash function for a set S is an injective mapping from S to {0, . . . |S|-1}. Taking as our model of computation a unit-cost RAM with a word length of w bits, we consider the problem of constructing minimal perfect hash functions with ...
Tight Bounds for Monotone Minimal Perfect Hashing
The monotone minimal perfect hash function (MMPHF) problem is the following indexing problem. Given a set \(S=\{s_{1},\ldots,s_{n}\}\) of \(n\) distinct keys from a universe \(U\) of size \(u\) , create a data structure \(\text{D}\) that answers ...

Comments

Information & Contributors

Information

Published In

STACS '01: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science

February 2001

574 pages

ISBN:3540416951

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 February 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Aamand AKnudsen JKnudsen MRasmussen PThorup MMakarychev KMakarychev YTulsiani MKamath GChuzhoy J(2020)Fast hashing with strong concentration boundsProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384259(1265-1278)Online publication date: 22-Jun-2020
https://dl.acm.org/doi/10.1145/3357713.3384259
Kleindessner MVon Luxburg U(2017)Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysisThe Journal of Machine Learning Research10.5555/3122009.315301418:1(1889-1940)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3122009.3153014
Belazzougui DVenturini R(2016)Compressed String Dictionary Search with Edit Distance OneAlgorithmica10.1007/s00453-015-9990-074:3(1099-1122)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1007/s00453-015-9990-0
Orlandi AVenturini R(2016)Space-Efficient Substring Occurrence EstimationAlgorithmica10.1007/s00453-014-9936-y74:1(65-90)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/s00453-014-9936-y
Müller ISanders PSchulze RZhou W(2014)Retrieval and Perfect Hashing Using FingerprintingProceedings of the 13th International Symposium on Experimental Algorithms - Volume 850410.1007/978-3-319-07959-2_12(138-149)Online publication date: 29-Jun-2014
https://dl.acm.org/doi/10.1007/978-3-319-07959-2_12
Belazzougui DVenturini RKhanna S(2013)Compressed static functions with applicationsProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627834(229-240)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627834
Botelho FShilane PGarg NHsu WSmith KZhou Y(2013)Memory efficient sanitization of a deduplicated storage systemProceedings of the 11th USENIX conference on File and Storage Technologies10.5555/2591272.2591282(81-94)Online publication date: 12-Feb-2013
https://dl.acm.org/doi/10.5555/2591272.2591282
Belazzougui D(2012)Worst-case efficient single and multiple string matching on packed texts in the word-RAM modelJournal of Discrete Algorithms10.1016/j.jda.2011.12.01114(91-106)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.jda.2011.12.011
Ferragina PSirén JVenturini R(2011)Distribution-aware compressed full-text indexesProceedings of the 19th European conference on Algorithms10.5555/2040572.2040655(760-771)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.5555/2040572.2040655
Julien C(2011)The context of coordinating groups in dynamic mobile networksProceedings of the 13th international conference on Coordination models and languages10.5555/2022052.2022056(49-64)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.5555/2022052.2022056
Show More Cited By

View Options

View options

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

Monotone minimal perfect hashing: searching a sorted table with O(1) accesses

Simple Minimal Perfect Hashing in Less Space

Tight Bounds for Monotone Minimal Perfect Hashing

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations