Skip to main content
SpringerLink
Log in

An algebraic approach to Cichelli's perfect hashing

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The aim of this paper is to describe a new approach to building minimal and perfect hash functions for a predefined set of keys. Several papers have dealt with this problem and proposed various kinds of functions. This study is based on a function whose address depends both on the letter codes and the letter position in the key, and therefore represents an extension of Cichelli's function. The weights associated with the position are considered to be fixed, and letter code computing is considered to be an interpolation problem. As a result, hash building only requires the solution of an algebraic linear system and then the time complexity is polynomialO(n 3).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Bell and B. Floyd,A Monte Carlo study of Cichelli of hash-function solvability, Communication of the ACM, November 1983, Vol. 26, No. 11, 924–925.

    Google Scholar 

  2. Cercone, N. Boates and J. Krause,An interactive system for finding perfect hash functions, IEEE Software, 2, 6 (1985), 38–53.

    Google Scholar 

  3. C. C. Chang,The study of an ordered minimal perfect hashing scheme, Communication of the A.C.M., April 1984, Vol. 27, No. 4, 384–387.

    Google Scholar 

  4. C. C. Chang,An ordered minimal perfect hashing scheme with single parameter, Information Processing Letters, February 1988, Vol. 27, 79–83.

    Article  MathSciNet  Google Scholar 

  5. R. J. Cichelli,Perfect hash function made simple, Communication of A.C.M., January 1980, Vol. 23, No. 1, 17–19.

    Google Scholar 

  6. W. Feller,An Introduction to Probability Theory and its Applications, John Wiley and Sons, Inc., New York 1971.

    Google Scholar 

  7. G. Jaeschke and G. Osterburg,On Cichelli's minimal perfect hash functions method. Communication of the ACM (technical correspondence), December 1980, Vol. 23, No. 12, 728–729.

    Google Scholar 

  8. G. Jaeschke,Reciprocal hashing: A method for generating minimal perfect hashing functions, Communication of the A.C.M., December 1981, Vol. 24, No. 12, 829–833.

    Google Scholar 

  9. C. Radhakrishna Rao and Sujit Kumar Mitra,Generalized Inverse of Matrices and its Applications, John Wiley and Sons, Inc., New York, London, Sydney, Toronto 1971.

    Google Scholar 

  10. T. J. Sager,A polynominal time generator for minimal perfect hash functions, Communication of the ACM, May 1985, Vol. 28, No. 5, 523–532.

    Google Scholar 

  11. R. Sprugnoli,Perfect hashing functions: A single probe retreving method for static sets, Communication of the A.C.M., November 1977, Vol. 20, No. 11, 841–850.

    Google Scholar 

  12. W. P. Yang and M. W. Du,A backtracking method for constructing perfect hash functions from a set of mapping functions, BIT 25 (1985), 148–164.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università di Firenze, Via S. Marta, 3, 50139, Firenze, Italy

    M. Gori & G. Soda

Authors
  1. M. Gori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Soda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gori, M., Soda, G. An algebraic approach to Cichelli's perfect hashing. BIT 29, 2–13 (1989). https://doi.org/10.1007/BF01932700

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932700

CR categories

Search

Navigation