Skip to main content
SpringerLink
Log in

Partial match retrieval

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The study of partial match file designs is continued. This study is concerned with a class of file designs which properly contains theABD designs of Rivest. A new family of partial match files is presented, the worst case performance is determined, and the implementation of these files is discussed.

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. C. T. Abraham, S. P. Ghosh and D. K. Ray-Chaudhuri,File organization schemes based on finite geometries, Information and Control 12 (February 1968), 143–163.

    Google Scholar 

  2. W. A. Burkhard and R. M. Keller,Some approaches to best-match file searching, CACM 16:4 (April 1973), 230–236.

    Google Scholar 

  3. R. A. Gustafson,A Randomized Combinatorial File Structure for Storage and Retrieval Systems, Ph. D. Thesis, University of South Carolina (1969), p. 92.

  4. D. M. Jackson,Classification, relevance and information retrieval, in Advances in Computers, 11, Academic Press, 59–125.

  5. D. E. Knuth,The art of Computer Programming, Volume 3, Sorting and Searching, Addison-Wesley Publishing Company, Reading, Massachusetts (1973).

    Google Scholar 

  6. J. Minker,An overview of associative or content addressable memory systems and a KWIC index to the literature, TR-157, University of Maryland Computer Science Center, (June 1971), p. 140.

  7. R. L. Rivest,Analysis of associative retrieval algorithms, Ph. D. Thesis, Stanford University (1974), p. 102.

  8. R. L. Rivest,On hash-coding algorithms for partial-match retrieval, 15th Annual Symposium on Switching and Automata Theory (October 1974), 95–103.

  9. R. L. Rivest,Partial-Match Retrieval Algorithms, to appear in SIAM Computing Journal.

  10. E. Wong and T. C. Chiang,Canonical structure in attribute based file organization, CACM 14:9 (September 1971), 593–597.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Division Department of Applied Physics and Information Science, University of California, San Diego, 92093, La Jolla, California, USA

    W. A. Burkhard

Authors
  1. W. A. Burkhard
    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

Burkhard, W.A. Partial match retrieval. BIT 16, 13–31 (1976). https://doi.org/10.1007/BF01940774

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation