Effective Generation of Minimal Perfect Hash Functions for Information Retrieval from Large Sets of Data


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 9, pp. 2256-2270, Sep. 1998
10.3745/KIPSTE.1998.5.9.2256,   PDF Download:

Abstract

The development of a high performance index system is crucial for the retrieval of information from large sets of data. In this study, a minimal perfect hash function (MPHF), which hashes m keys to m buckets with no collisions, is revisited. The MOS algorithm developed by Heath is modified to be successful for computing MPHFs of large sets of keys. Also, a system for generating MPHFs for large sets of keys is developed. This system computed MPHFs for several large sets of data more efficiently than Heat's. The application areas for this system include those for generating MPHFs for the indexing of large and infrequently changing sets of data as well as information stored in a medium whose seek time is very slow.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. S. Hee and P. S. Young, "Effective Generation of Minimal Perfect Hash Functions for Information Retrieval from Large Sets of Data," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 9, pp. 2256-2270, 1998. DOI: 10.3745/KIPSTE.1998.5.9.2256.

[ACM Style]
Kim Su Hee and Park Se Young. 1998. Effective Generation of Minimal Perfect Hash Functions for Information Retrieval from Large Sets of Data. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 9, (1998), 2256-2270. DOI: 10.3745/KIPSTE.1998.5.9.2256.