Skip to main content
SpringerLink
Log in

Partial-match retrieval for dynamic files

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This paper studies file designs for answering partial-match queries for dynamic files. A partial-match query is a specification of the value of zero or more fields in a record. An answer to a query consists of a listing of all records in the file satisfying the values specified.

The main contribution is a general method whereby certain primary key hasing schemes can be extended to partial-match retrieval schemes. These partial-match retrieval designs can handle arbitrarily dynamic files and can be optimized with respect to the number of page faults required to answer a query.

We illustrate the method by considering in detail the extension of two recent dynamic primary key hashing schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho and J. D. Ullman,Optimal partial-match retrieval when fields are independently specified, ACM Trans. Database Syst. 4, 2 (June 1979), 168–179.

    Google Scholar 

  2. A. Bolour,Optimality properties of multiple-key hashing functions, J. ACM., 26, 2 (April 1979), 196–210.

    Google Scholar 

  3. W. A. Burkhard,Partial-match retrieval, BIT 16, 1 (1976), 13–31.

    Google Scholar 

  4. R. Fagin, J. Nievergelt, N. Pippenger and H. R. Strong,Extendible hasing — a fast access method for dynamic files, ACM Trans. Database Syst. 4, 3 (Sept. 1979), 315–344.

    Google Scholar 

  5. P. Larson,Linear hashing with partial expansions, Proc. 6th Inter. Conf. on Very Large Databases, 1980, 224–232.

  6. W. Litwin,Linear hashing: a new tool for file and table addressing, Proc. 6th Inter. Conf. on Very Large Databases, 1980, 212–223.

  7. J. W. Lloyd,Optimal partial-match retrieval, BIT 20 (1980), 406–413.

    Google Scholar 

  8. J. L. Pfaltz, W. J. Berman and E. M. Cagley,Partial-match retrieval using indexed descriptor files, CACM, 23, 9 (Sept. 1980), 522–528.

    Google Scholar 

  9. R. L. Rivest,Partial-match retrieval algorithms, SIAM J. Comp. 5, 1 (1976), 19–50.

    Google Scholar 

  10. J. B. Rothnie and T. Lozano,Attribute based file organization in a paged memory environment, CACM, 17, 2 (Feb. 1974), 63–69.

    Google Scholar 

  11. T. L. Saaty,Optimization in Integers and Related Extremal Problems, McGraw-Hill, New York, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Melbourne, Melbourne, Australia

    John W. Lloyd & K. Ramamohanarao

Authors
  1. John W. Lloyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Ramamohanarao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lloyd, J.W., Ramamohanarao, K. Partial-match retrieval for dynamic files. BIT 22, 150–168 (1982). https://doi.org/10.1007/BF01944474

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01944474

Keywords and phrases

CR categories

Search

Navigation