Abstract
This paper proposes the use of genetic algorithms (GAs) for optimizing the sequence of large joins execution on parallel shared-nothing database architectures. In order to measure the suitability of this method we compare the GA that we have specifically developed for this problem with previously proposed GAs. Experimental results show that our GA was able to outperform its counterparts. We also compare the performance of our GA with some known heuristics that were employed for optimizing joins in parallel queries. It turned out that for smaller number of relations, heuristics were able to produce query execution plans as good as those of GAs. However when the number of relations increases, GAs outperform heuristics.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
K.Bennett, M.Ferris, and Y.Ioannidis, A Genetic Algorithm for Database Query Optimization, Computer Science Technical Report No. 1004,Wisconsin university, 1991.
D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Leaming, Addison Wesley, MA, 1989.
J. Grefenstette. Incorporating Problem Specific Knowledge into Genetic Algorithms. IN L Davis, editor, GAs and Simulated Annealing, Pitman Publisher, London 1987.
Y. E. Ioannidis, and Y. Kang, Randomized Algorithms for Optimizing Large Join Queries, Proceedings SIGMOD 90, May 1990.
Z. Michalewicz, GAs + Data Structures=Evolution Programs, Springer-Veriag, 1994.
K. Nafjan and J. M. Kerridge, Toward an Object-oriented Interface to a Parallel Shared-nothing Database Machine, Submitted for publication.
P. G. Selinger et al, Access Path Selection in a Relational DBMS, Proceedings of ACM SIGMOD-International Conference on Management of Data, May, 1979.
M. Steinbumn, G. Morekotte, A. Kemper, Optimizing Join Orders, Technical Report MIP-9307, University of Passau,1993.
A. Swami and A. Gupta, Optimization of Large Join Queries, SIGMOD Record, vol. 17. 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nafjan, K.A., Kerridge, J.M. (1997). Large join order optimization on parallel shared-nothing database machines using genetic algorithms. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002867
Download citation
DOI: https://doi.org/10.1007/BFb0002867
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive