The enhancement of semijoin strategies in distributed query optimization
We investigate the problem of optimizing distributed queries by using semijoins in order to minimize the amount of data communication between sites. The problem is reduced to that of finding an optimal semijoin sequence that locally fully reduces the relations referenced in a general query graph before processing the join operations.
Unable to display preview. Download preview PDF.
- 2.S. Ceri and G. Pelagatti. Distributed Databases: Principles and Systems. McGraw-Hill, 1985.Google Scholar
- 4.F. Najjar, Y. Slimani, S. Tlili, and J. Boughizane. Heuristics to determine a general sequence of semijoins in distributed query processing. Proc. of the 9 th IASTED Int. Conf., PDCS, Washington D. C. (USA), Oct. 1997, pp. 354–359.Google Scholar
- 5.C. Wang and M-S. Chen. On the Complexity of Distributed Query Optimization. IEEE TKDE, vol. 8(4), Aug. 1996, pp. 650–662.Google Scholar
- 6.H. Yoo and S. Lafortune. An Intelligent Search Method for Query Optimization by Semijoins. IEEE TKDE, vol. 1(2), Jun. 1989, pp. 226–237.Google Scholar