Abstract
Chang and Wu have proposed a letter-oriented perfect hashing scheme based on sparse matrix compression. We present a method which is a refinement of the Chang-Wu scheme. By experimental evaluation, we show that the hashing of our refinement has more efficient storage utilization than Chang-Wu's method. Our refinement is valuable in practical implementations of hashing for large sets of keys.
Similar content being viewed by others
References
Aho, A. V. and Ullman, J. D.,Principles of Compiler Design, Addison-Wesley, Reading, MA., 1977.
Chang, C. C. and Wu, T. C.,A letter-oriented perfect hasing scheme based upon sparse table compression, Software — Practice and Experience, Vol. 21, No. 1, 1991, pp. 35–49.
Sprugnoli, R.,Perfect hashing functions: a single probe retrieving method for static sets, Communications of the ACM, Vol. 20, No. 11, 1977, pp. 841–850.
Ziegler, S. F.,Smaller faster table driven parser, Madison Academic Computing Center, University of Wisconsin, Madison, Wisconsin, 1977.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chang, CC., Kowng, HC. & Wu, TC. A refinement of a compression-oriented addressing scheme. BIT 33, 529–535 (1993). https://doi.org/10.1007/BF01990533
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01990533