Skip to main content
SpringerLink
Log in

The Study of a Letter Oriented Minimal Perfect Hashing Scheme

  • Chapter
Foundations of Data Organization

  • 136 Accesses

Abstract

In this paper, a simple method shall be presented to construct minimal perfect hashing functions suitable for letter oriented keys. We applied this minimal perfect hashing method successfully to four non-trivial key sets: (1) the set of twelve months in English, (2) the set of thirty four non-printable ASCII identifiers, (3) the set of thirty one most frequently used English words, (4) the set of thirty six PASCAL reserved words.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chang, C. C., (1984a): The Study of an Ordered Minimal Perfect Hashing Scheme, Communications of the Association for Computing Machinery, Vol. 27, No. 4, April 1984, pp. 384–387.

    Article  MathSciNet  Google Scholar 

  2. Chang, C. C., (1984b): An Ordered Minimal Perfect Hashing Scheme Based Upon Euler’s Theorem, Information Sciences, Vol. 32, No. 3, June 1984, pp. 165–172.

    Article  MathSciNet  MATH  Google Scholar 

  3. Cichelli, R. J., (1980): Minimal Perfect Hash Functions Made Simple, Communications of the Association for Computing Machinery, Vol. 23, No. 1, January 1980, pp. 17–19.

    Article  Google Scholar 

  4. Cook, C. R. and Oldehoeft, R. R., (1982) : A Letter Oriented Minimal Perfect Hashing Function, SigpIan Notices, Vol. 17, No. 9, September 1982 , pp. 18–27.

    Article  Google Scholar 

  5. Du, M. W., Hsieh, T. M., Jea, K. F. and Shieh, D. W., (1983): The Study of A New Perfect Hash Scheme, IEEE Transactions on Software Engineering, Vol. SE-9, No. 3, May 1983, pp. 305–313.

    Article  Google Scholar 

  6. Ghosh, S. P., (1977): Data Base Organization for Data Management, Academic Press, New York, 1977, pp. 148–151.

    Google Scholar 

  7. Jaeschke, G., (1981): Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions, Communications of the Association for Computing Machinery, Vol. 24, No. 12, December 1981, pp. 829–833.

    Article  MathSciNet  MATH  Google Scholar 

  8. Knuth, D. E., (1973): The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Mass., U.S.A., 1973.

    Google Scholar 

  9. Maurer, W. D., (1968) : An Improved Hash Code for Scatter Storage, Communications of the Association for Computing Machinery, Vol. 11, No. 1, January, 1968, pp. 35–37.

    Article  Google Scholar 

  10. Maurer, W. D. and Lewis, T. G., (1975) : Hash Table Method, Computing Surveys , Vol. 7, No. 1, March 1975, pp. 5–19.

    Article  MATH  Google Scholar 

  11. Morris, R., (1968): Scatter Storage Techniques, Communications of the Association for Computing Machinery, Vol. 11, No. 1, January 1968, pp. 38–44.

    Article  Google Scholar 

  12. Severance, D. G., (1974): Identifier Search Mechanisms: A Survey and Generalized Model, Computing Surveys, Vol. 6, No. 3, September 1974, pp. 175–194.

    Article  MATH  Google Scholar 

  13. Sprugnoli, R., (1977): Perfect Hashing Functions: A Single-Probe Retrieving Method for Static Sets, Communications of the Association for Computing Machinery, Vol. 20, No. 11, November 1977, pp. 841–850.

    Article  MathSciNet  MATH  Google Scholar 

  14. Yang, W. P., Du, M. W. and Tsay, J. C., (1983): Single-Pass Perfect Hashing for Data Storage and Retrieval, Proceedings 1983 Conference on Information Sciences and Systems, Baltimore, Mayland, May 1983, pp. 470–476.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan

    C. C. Chang

Authors
  1. C. C. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Almaden Research Center, San Jose, California, USA

    Sakti P. Ghosh

  2. Kyushu University, Fukuoka, Japan

    Yahiko Kambayashi

  3. Kobe University, Kobe, Japan

    Katsumi Tanaka

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Plenum Press, New York

About this chapter

Cite this chapter

Chang, C.C. (1987). The Study of a Letter Oriented Minimal Perfect Hashing Scheme. In: Ghosh, S.P., Kambayashi, Y., Tanaka, K. (eds) Foundations of Data Organization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1881-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1881-1_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9048-3

  • Online ISBN: 978-1-4613-1881-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation