This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Query Processing for Distributed Database Systems
September 1982 (vol. 31 no. 9)
pp. 835-850
W.W. Chu, Department of Computer Science, School of Engineering and Applied Science, University of California
A model is developed for determining the optimal policy for processing a given relational model query. The model is based on operating cost (processing cost and communication cost), which is a function of selection of sites for processing query operations, sequence of operations, file size, and data reduction functions. The optimal policy specifies the site selection and sequence of operations that yield minimum operating cost.
Index Terms:
relational database, Distributed database, local operation group, optimal query processing, query operating cost, query processing graph, query tree, relational algebra
Citation:
W.W. Chu, P. Hurley, "Optimal Query Processing for Distributed Database Systems," IEEE Transactions on Computers, vol. 31, no. 9, pp. 835-850, Sept. 1982, doi:10.1109/TC.1982.1676099
Usage of this product signifies your acceptance of the Terms of Use.