Skip to main content
Log in

Multi-attribute hashing with multiple file copies for high performance partial-match retrieval

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

Abstract

The average cost for answering partial-match queries can be dramatically reduced by storing multiple copies of the data, each with a different clustering. We analyse the cost benefits (in terms of page accesses) of this arrangement and present heuristic algorithms for determining a near-minimal-cost file organisation for a given probability distribution of queries. We also show how constraining the range of values for specific attributes affects the usefulness of maintaining multiple copies.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

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 Trasactions on Database Systems 4, 2 (June 1979), 168–179.

    Google Scholar 

  2. W. A. Burkhard,Partial-match hash coding: benefits of redundancy, ACM Transactions on Database Systems 4, 3 (September 1979), 228–239.

    Google Scholar 

  3. A. F. Cardenas,Analysis and performance of inverted database structures, Communications of the ACM, 18, 5 (1975), 253–263.

    Google Scholar 

  4. D. E. Knuth,The Art of Computer Programming, vol. 3 Searching and Sorting, Addison-Wesley, Reading Mass., 1973.

    Google Scholar 

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

    Google Scholar 

  6. J. W. Lloyd and K. Ramamohanarao,Partial-match retrieval for dynamic files, BIT 22 (1982), 150–168.

    Google Scholar 

  7. V. Y. Lum,Multi-attribute retrieval with combined indexes, Communications of the ACM 13, 11 (November 1970), 660–665.

    Google Scholar 

  8. S. Moran,On the complexity of designing optimal partial-match retrieval systems, ACM Transactions on Database Systems 8, 4 (December 1983), 543–551.

    Google Scholar 

  9. S. Nahar, S. Sahni and E. Shargowitz,Experiments with simulated annealing, Proceedings of the 22nd Design Automation Conference, 1985, 748–752.

  10. J. Nievergelt, H. Hinterberger and K. C. Sevcik,The grid file: an adaptable symmetric multikey file structure, ACM Transactions on Database Systems, 9, 1 (March 1984), 38–71.

    Google Scholar 

  11. K. Ramamohanarao, J. W. Lloyd and J. A. Thom,Partial-match retrieval using hashing and descriptors, ACM Transactions on Database Systems, 8, 4 (December 1983), 552–576.

    Google Scholar 

  12. K. Ramamohanarao and R. Sacks-Davis,Recursive linear hasing, ACM Transactions on Database Systems 9, 3 (September 1984), 369–391.

    Google Scholar 

  13. K. Ramamohanarao, J. Shepherd and R. Sacks-Davis,Partial-match retrieval using multiple-key hashing with multiple file copies, Technical Report 88/32, Department of Computer Science University of Melbourne, Melbourne, Australia, December 1988.

    Google Scholar 

  14. R. L. Rivest,Partial match retrieval algorithms, SIAM Journal of Computing 5, 1 (1976), 19–50.

    Google Scholar 

  15. C. S. Roberts,Partial match retrieval via the method of superimposed codes, Proceedings of the IEEE 67, 2 (1979), 522–528.

    Google Scholar 

  16. J. B. Rothnie and T. Lozano,Attribute based file organization in a paged memory environment, Communications of the ACM 17, 2 (1974), 63–69.

    Google Scholar 

  17. J. A. Thom, L. Naish and K. Ramamohanarao,A superjoin algorithm for deductive databases, Preprints of the Workshop on Foundations of Deductive Databases and Logic Programming, Washington, D.C., August 1986, 118–135.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ramamohanarao, K., Shepherd, J. & Sacks-Davis, R. Multi-attribute hashing with multiple file copies for high performance partial-match retrieval. BIT 30, 404–423 (1990). https://doi.org/10.1007/BF01931657

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR Categories

Keywords and phrases

Navigation