Partial match retrieval using recursive linear hashing
- 29 Downloads
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.
Keywordspartial match retrieval linear hashing dynamic files
CR categories3.74 4.33 4.34
Unable to display preview. Download preview PDF.
- 2.P.-Å. Larson,Linear hashing with partial expansions. Proc. 6th Int. Conf. on Very Large Data Bases, Montreal, 1980, p. 224–232.Google Scholar
- 3.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.Google Scholar
- 4.W. Litwin,Linear hashing: a new tool for files and table addressing, Proc. 6th Conf. Very Large Data Bases, Montreal, 1980, 212–223.Google Scholar
- 5.J. W. Lloyd and K. Ramamohanarao,Partial-match retrieval for dynamic files, BIT 22, 1982, 150–168.Google Scholar
- 7.L. Naish and J. A. Thom,The MU-PROLOG deductive database, Tech. Rep. 83/10, Dept. Computer Science, University of Melbourne, 1983.Google Scholar
- 8.K. Ramamohanarao and J. W. Lloyd,Dynamic hashing schemes, The Comp. J. vol. 25, No. 4, 1982, 478–485.Google Scholar
- 11.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.Google Scholar