Abstract
An algorithm for selecting the concatenated hash code for partial-match or multiple-attribute retrieval in a hashing scheme is presented. The optimal code length for each attribute is determined with respect to a merit function. Two adjustment algorithms are then presented to find the optimal code length under the integer and nonnegative lower bound constraints. Finally, an algorithm is given for incremental expansion of the concatenated hash code in an extendible hashing scheme.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. A. Larson, Dynamic Hashing,BIT 18, pp. 184–201 (1978).
W. Litwin, Virtual hashing: A dynamically changing hashing,Proc. of very Large Databases Conf., Berlin, pp. 517–523 (1978).
R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, Extendible Hashing—A Fast Access Method for Dynamic Files, IBM Research Report RJ2305 (July 1978).
A. V. Aho and J. D. Ullman, Optimal Partial-Match Retrieval when Fields are Independently Specified,ACM Trans. on Database Syst.,4(2):168–179 (June 1979).
Author information
Authors and Affiliations
Additional information
This research was supported by the Defense Advanced Research Projects Agency under Contract MDA903-78-C-0293, and the National Science Foundation under Grant NCS78-05978.
Rights and permissions
About this article
Cite this article
Chang, S.K., Dorng, J.C. Concatenated hash code selection. International Journal of Computer and Information Sciences 13, 395–412 (1984). https://doi.org/10.1007/BF00991658
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991658