This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
November 1984 (vol. 33 no. 11)
pp. 959-967
A.L.P. Chen, Department of Electrical Engineering, University of Southern California
The problem of optimal query processing in distributed database systems was shown to be NP-hard. This means that heuristic algorithms are necessary to solve the query processing problem. In this paper, we describe algorithms to improve the solutions generated by heuristics. We have identified four properties which optimal semijoin programs for processing tree queries have to satisfy. A semijoin program is represented by an execution graph which specifies the order and the identities of the semijoins to be executed. Given a semijoin program, we can therefore apply these properties to check its optimality. If it does not satisfy these optimality properties, the associated improvement algorithms can be applied to improve this program. No assumptions have been made about the relation size and the selectivity of the semijoins.
Index Terms:
semijoin programs, Distributed database systems, heuristic algorithms, improvement algorithms, optimality properties, query optimization, query processing, relational data model
Citation:
A.L.P. Chen, V.O.K. Li, "Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems," IEEE Transactions on Computers, vol. 33, no. 11, pp. 959-967, Nov. 1984, doi:10.1109/TC.1984.1676370
Usage of this product signifies your acceptance of the Terms of Use.