Skip to main content
SpringerLink
Log in

A backtracking method for constructing perfect hash functions from a set of mapping functions

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

Abstract

This paper presents a backtracking method for constructing perfect hash functions from a given set of mapping functions. A hash indicator table is employed in the composition. By the nature of backtracking, the method can always find a perfect hash function when such a function does exist according to the composing scheme. Simulation results show that the probability of getting a perfect hash function by the backtracking method is much higher than by the single-pass and multipass methods previously proposed.

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. M. R. Anderson and M. G. Anderson,Comments on perfect hashing functions: A single probe retrieving method for static sets. Comm. ACM 22, 2 (Feb. 1979), 104.

    Article  Google Scholar 

  2. J. R. Bitner and E. M. Reingold,Backtrack programming techniques. Comm. ACM 18, 11 (Nov. 1975), 651–656.

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. C. R. Cook and R. R. Oldehoeft,A letter oriented minimal perfect hashing function. ACM Trans. on SIGNPLAN NOTICES 17, 9 (Sept. 1982), 18–27.

    Google Scholar 

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

    Article  Google Scholar 

  6. M. W. Du, T. M. Hsieh, K. F. Jea and D. W. Shieh,The study of a new perfect hash scheme. IEEE Trans. on Software Engineering, SE-9, 3 (May 1983), 305–313.

    Google Scholar 

  7. S. W. Goloma and L. D. Baumert,Backtrack programming. JACM 12, 4 (1965), 516–524.

    Article  Google Scholar 

  8. E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Computer Science Press, INC., 1978.

  9. G. Jaeschke and G. Osterburg,On Chichelli's minimal perfect hash functions method. Comm. ACM 23, 12 (Dec. 1980), 728–729.

    Google Scholar 

  10. G. Jaeschke,Reciprocal hashing: A method for generating minimal perfect hashing functions. Comm. ACM 24, 12 (Dec. 1981), 829–833.

    Article  Google Scholar 

  11. D. E. Knuth,The Art of Computer Programming, Vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  12. W. D. Maurer,An improved hash code for scatter storage. Comm. ACM 11, 1 (Jan. 1968), 35–37.

    Article  Google Scholar 

  13. W. D. Maurer and T. G. Lewis,Hash table method. Computing Surveys 7, 1 (Mar. 1975), 5–19.

    Article  Google Scholar 

  14. R. Morris,Scatter storage techniques. Comm. ACM 11, 1 (Jan. 1968), 38–44.

    Article  Google Scholar 

  15. D. G. Severance,Identifier search mechanisms: A survey and generalized model. Computing Surveys 6, (Sep. 1974), 175–194.

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. W. P. Yang, M. W. Du and J. C. Tsay,Single-pass perfect hashing for data storage and retrieval. Proc. 1983 Conf. on Information Sciences and Systems, Baltimore, Maryland, Mar. 1983, 470–476.

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Engineering, National Chiao Tung University, 45 Po Ai Street, Hsinchu, Taiwan, Republic of China

    W. P. Yang & M. W. Du

Authors
  1. W. P. Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. W. Du
    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

Yang, W.P., Du, M.W. A backtracking method for constructing perfect hash functions from a set of mapping functions. BIT 25, 148–164 (1985). https://doi.org/10.1007/BF01934995

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation