Parallel optimisation of join queries using an enhanced iterative improvement technique
A parallel optimisation technique for large join queries is presented. The technique processes the search space of query execution plans twice: the first scan is based on iterative improvement; the second scan uses the results of the first one to reduce the search space, in order to find an optimal solution faster. Two scheduling algorithms are studied for the imple-mentation of the technique. Experiments showing the behaviour of the technique are presented.
Unable to display preview. Download preview PDF.
- 1.J.Y.Cotronis, P.E.Lauer “Two Way Channel with Disconnect”, Proc. on the Analysis of Concurrent Systems, LNCS Vol.207, 184–198, 1985Google Scholar
- 2.Y.E.Ioannidis, Y.C.Kang “Randomized Algorithms for Optimizing Large Join Queries”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data (Atlantic City, NJ), 312–321, 1990Google Scholar
- 3.Y.E.Ioannidis, Y.C.Kang “Left-deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications on Query Optimization”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data (Denver, Colorado), 168–177, 1991Google Scholar
- 4.M.Spiliopoulou “Parallel Optimisation and Execution of Queries towards an RDBMS in a Parallel Environment Supporting Pipeline”, Ph.D.thesis, University of Athens, Department of Informatics, March 1992 (on Greek)Google Scholar
- 5.M. Spiliopoulou, M. Hatzopoulos, C. Vassilakis “Using Parallelism and Pipeline for the Optimisation of Join Queries”, Proc. Parle'92 Conf. (Paris, France), LNCS Vol.605, 279–294, 1992Google Scholar
- 6.A.Swami, A.Gupta “Optimization of large join queries”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data (Chicago, Illinois), 8–17, Sept. 1988Google Scholar
- 7.A.Swami “Optimization of large join queries: Combining heuristics and combinatorial techniques”, Proc. ACM-SIGMOD Intl. Conf. on Management of Data (Portland, Oregon), 367–376, June 1989Google Scholar