[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

A modulus oriented hash function for the construction of minimal perfect tables

Published: 01 November 1992 Publication History
First page of PDF

References

[1]
{1} C.R. Cook and R.R. Oldehoeft, 'A letter oriented minimal perfect hashing function', SIGPLAN Notices, 17, 18- 27 (1982).
[2]
{2} R.J. Cichelli, 'Minimal perfect hash functions made simple', Comm. ACM, 23, 17-19 (1980).
[3]
{3} G. Jaeschke, G. Osterburg, 'On Cichelli's minimal perfect hash functions method', Comm. ACM, 23, 728-729 (1980).
[4]
{4} G. Jaeschke, 'Reciprocal hashing: a method for generating minimal perfect hashing functions', Comm. ACM, 24, 829-833 (1981).
[5]
{5} D. E. Knuth, The art of computer programming, Addison Wesley Publishing Company, Massachussets, 1973.
[6]
{6} W.D. Maurer, 'An improved hash code for scatter storage', Comm. ACM, 11, 35-37 (1968).
[7]
{7} R. Morris, 'Scatter storage techniques', Comm. ACM, 11, 38-44, (1968).
[8]
{8} M. Schatzoff, 'Design of experiments in computer performance and evaluation', IBM Journal of Research and Development, 25, 848-859 (1981).
[9]
{9} R. Sprugnoli, 'Perfect hashing functions: a single probe retrieving method for static sets', Comm. ACM, 20, 841-851, (1977).
[10]
{10} Vax COBOL -Language Reference Manual, DEC, Massachussets.
[11]
{11} Vax DataTrieve - Language Reference Manual, DEC, Massachussets.
[12]
{12} Vax/VMS Command Language - User's Guide, DEC, Massachussets.

Cited By

View all
  • (1995)A comparison of three strategies for computing letter oriented, minimal perfect hashing functionsACM SIGPLAN Notices10.1145/202176.20217930:4(29-35)Online publication date: 1-Apr-1995

Index Terms

  1. A modulus oriented hash function for the construction of minimal perfect tables

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 27, Issue 11
    Nov. 1992
    86 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/141018
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 November 1992
    Published in SIGPLAN Volume 27, Issue 11

    Check for updates

    Author Tags

    1. hash tables
    2. minimal hash tables
    3. perfect hashing functions

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 14 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (1995)A comparison of three strategies for computing letter oriented, minimal perfect hashing functionsACM SIGPLAN Notices10.1145/202176.20217930:4(29-35)Online publication date: 1-Apr-1995

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media