Abstract
Recursive linear hashing is a hashing technique proposed for files which can grow and shrink dynamically. The scheme is an extension of linear hashing, a method originally proposed by Litwin, but unlike Litwin's scheme, it does not require conventional overflow pages. In this paper, we investigate the application of recursive linear hashing to partial match retrieval problems. Consistent with the results for primary key retrieval, recursive linear hashing performs better than the conventional scheme on these problems, especially at high load factors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho and J. D. Ullman,Optimal partial-match retrieval when fields are independently specified, ACM Trans. Database Syst. 4, 2, 1979, 168–179.
P.-Å. Larson,Linear hashing with partial expansions. Proc. 6th Int. Conf. on Very Large Data Bases, Montreal, 1980, p. 224–232.
P. Å. Larson,A single file version of linear hashing with partial expansions. Proc. 8th Intl. Conf. on Very Large Data bases, 1982, p. 300–309.
W. Litwin,Linear hashing: a new tool for files and table addressing, Proc. 6th Conf. Very Large Data Bases, Montreal, 1980, 212–223.
J. W. Lloyd and K. Ramamohanarao,Partial-match retrieval for dynamic files, BIT 22, 1982, 150–168.
J. K. Mullin,Tightly controlled linear hashing without separate overflow storage, BIT 21, 1981, 390–400.
L. Naish and J. A. Thom,The MU-PROLOG deductive database, Tech. Rep. 83/10, Dept. Computer Science, University of Melbourne, 1983.
K. Ramamohanarao and J. W. Lloyd,Dynamic hashing schemes, The Comp. J. vol. 25, No. 4, 1982, 478–485.
K. Ramamohanarao, J. W. Lloyd and J. A. Thom,Partial-match retrieval using hashing and descriptors, ACM Trans. Database Syst. Vol. 8, No. 4, 1983, 552–576.
K. Ramamohanarao and R. Sacks-Davis,Recursive linear hashing, ACM Trans. Database Syst, Vol. 9, No. 3, 1984, 369–391.
K. Ramamohanarao and R. Sacks-Davis,Partial-match retrieval for dynamic files using linear hashing with partial expansions, Technical Report 85/2, The University of Melbourne, Vic., Australia, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ramamohanarao, K., Sacks-Davis, R. Partial match retrieval using recursive linear hashing. BIT 25, 477–484 (1985). https://doi.org/10.1007/BF01935368
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01935368