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.
Similar content being viewed by others
References
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.
W. A. Burkhard,Partial-match hash coding: benefits of redundancy, ACM Transactions on Database Systems 4, 3 (September 1979), 228–239.
A. F. Cardenas,Analysis and performance of inverted database structures, Communications of the ACM, 18, 5 (1975), 253–263.
D. E. Knuth,The Art of Computer Programming, vol. 3 Searching and Sorting, Addison-Wesley, Reading Mass., 1973.
J. W. Lloyd,Optimal partial-match retrieval, BIT 20 (1980), 406–413.
J. W. Lloyd and K. Ramamohanarao,Partial-match retrieval for dynamic files, BIT 22 (1982), 150–168.
V. Y. Lum,Multi-attribute retrieval with combined indexes, Communications of the ACM 13, 11 (November 1970), 660–665.
S. Moran,On the complexity of designing optimal partial-match retrieval systems, ACM Transactions on Database Systems 8, 4 (December 1983), 543–551.
S. Nahar, S. Sahni and E. Shargowitz,Experiments with simulated annealing, Proceedings of the 22nd Design Automation Conference, 1985, 748–752.
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.
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.
K. Ramamohanarao and R. Sacks-Davis,Recursive linear hasing, ACM Transactions on Database Systems 9, 3 (September 1984), 369–391.
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.
R. L. Rivest,Partial match retrieval algorithms, SIAM Journal of Computing 5, 1 (1976), 19–50.
C. S. Roberts,Partial match retrieval via the method of superimposed codes, Proceedings of the IEEE 67, 2 (1979), 522–528.
J. B. Rothnie and T. Lozano,Attribute based file organization in a paged memory environment, Communications of the ACM 17, 2 (1974), 63–69.
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.
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01931657