Abstract
The paper addresses the problem of quality estimation of the search space exploration strategy. The strategy is used to find a satisfying solution to the join ordering problem, which constitutes a crucial part of the database query optimization task. The method of strategy verification is based on the comparison of the execution time for the solution produced by the Invasive Weed Optimization (IWO) algorithm with the analogous value for the solution determined by the SQL Server 2008 optimizer. Solutions were generated for star queries that are common in data warehousing applications. The authors discuss representations of the single solution and describe the modified version of the IWO algorithm emphasizing features of the proposed hybrid method of the search space exploration. The results of the conducted experiments form the main topic of analysis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kostrzewa, D., Josiński, H.: Planning of the process of distributed data merging by means of evolutionary algorithm. In: Architecture, Formal Methods and Advanced Data Analysis, pp. 13–26. Wydawnictwa Komunikacji i Ła̧czności, Gliwice (2008)
Kostrzewa, D., Josiński, H.: Application of the invasive weed optimization algorithm for predetermination of the progress of distributed data merging process. Studia Informatica, 30(2A(83)), 79–92 (2009) (in Polish)
Kostrzewa, D., Josiński, H.: The comparison of an adapted evolutionary algorithm with the invasive weed optimization algorithm based on the problem of predetermining the progress of distributed data merging process. In: Cyran, K., Kozielski, S., Peters, J., Stańczyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. Advances in Intelligent and Soft Computing, vol. 59, pp. 505–514. Springer, Heidelberg (2009)
Kostrzewa, D., Josiński, H.: Methods for search of the space of query execution plans by means of the invasive weed optimization algorithm. Studia Informatica 31(2A(89)), 393–404 (2010)
Lanzelotte, R.S.G., Valduriez, P., Zaït, M.: On the effectiveness of optimization search strategies for parallel execution spaces. In: Proceedings of the 19th International Conference on Very Large Data Bases, pp. 493–504. Morgan Kaufmann Publishers Inc., San Francisco (1993)
Mallahzadeh, A., Oraizi, H., Davoodi-Rad, Z.: Application of the invasive weed optimization technique for antenna configurations. Progress in Electromagnetics Research, PIER (79), 137–150 (2008)
Mamaghani, A.S., Asghari, K., Mahmoudi, F., Meybodi, M.R.: A novel hybrid algorithm for join ordering problem in database queries. In: Proceedings of the 6th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, pp. 104–109 (2007)
Mehrabian, R., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics 1, 355–366 (2006)
Mishra, P., Eich, M.: Join processing in relational databases. ACM Computing Surveys 24(1) (1992)
Moerkotte, G.: Building Query Compilers (September 03, 2009) (draft), http://pi3.informatik.uni-mannheim.de/~moer/querycompiler.pdf
Morzy, T., Matysiak, M., Salza, S.: Tabu search optimization of large join queries. In: Jarke, M., Bubenko, J., Jeffery, K. (eds.) EDBT 1994. LNCS, vol. 779, pp. 309–322. Springer, Heidelberg (1994)
Sepehri Rad, H., Lucas, C.: A recommender system based on invasive weed optimization algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 4297–4304 (2007)
Steinbrunn, M., Moerkotte, G., Kemper, A.: Heuristic and randomized optimization for the join ordering problem. The VLDB Journal 6(3) (1997)
Tow, D.: SQL.Optimization. Helion, Gliwice (2004) (in Polish)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kostrzewa, D., Josiński, H. (2011). Verification of the Search Space Exploration Strategy Based on the Solutions of the Join Ordering Problem. In: Czachórski, T., Kozielski, S., Stańczyk, U. (eds) Man-Machine Interactions 2. Advances in Intelligent and Soft Computing, vol 103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23169-8_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-23169-8_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23168-1
Online ISBN: 978-3-642-23169-8
eBook Packages: EngineeringEngineering (R0)