Advertisement

BIT Numerical Mathematics

, Volume 25, Issue 3, pp 477–484 | Cite as

Partial match retrieval using recursive linear hashing

  • K. Ramamohanarao
  • R. Sacks-Davis
Part I Computer Science

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.

Keywords

partial match retrieval linear hashing dynamic files 

CR categories

3.74 4.33 4.34 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.CrossRefGoogle Scholar
  2. 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. 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. 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. 5.
    J. W. Lloyd and K. Ramamohanarao,Partial-match retrieval for dynamic files, BIT 22, 1982, 150–168.Google Scholar
  6. 6.
    J. K. Mullin,Tightly controlled linear hashing without separate overflow storage, BIT 21, 1981, 390–400.CrossRefGoogle Scholar
  7. 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. 8.
    K. Ramamohanarao and J. W. Lloyd,Dynamic hashing schemes, The Comp. J. vol. 25, No. 4, 1982, 478–485.Google Scholar
  9. 9.
    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.CrossRefMathSciNetGoogle Scholar
  10. 10.
    K. Ramamohanarao and R. Sacks-Davis,Recursive linear hashing, ACM Trans. Database Syst, Vol. 9, No. 3, 1984, 369–391.CrossRefMathSciNetGoogle Scholar
  11. 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

Copyright information

© BIT Foundations 1985

Authors and Affiliations

  • K. Ramamohanarao
    • 1
    • 2
  • R. Sacks-Davis
    • 1
    • 2
  1. 1.Department of Computer ScienceUniversity of MelbourneParkvilleAustralia
  2. 2.Department of ComputingRoyal Melbourne Institute of TechnologyMelbourneAustralia

Personalised recommendations