Abstract
The authors summarize the several years research on the join ordering problem presenting a method based on the exIWO metaheuristic which is characterized by both the hybrid strategy of the search space exploration and three variants of selection of individuals as candidates for next population. The nub of the problem was recalled along with details of adaptation of the exIWO including representation of a single solution and transformation of an individual. Results of the experiments show that the exIWO algorithm can successfully compete with the SQL Server 2008 DBMS in optimization of join order in database queries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ibaraki, T., Kameda, T.: Optimal nesting for computing N-relational joins. ACM Transactions on Database Systems 9(3), 482–502 (1984)
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.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. AISC, vol. 59, pp. 505–514. Springer, Heidelberg (2009)
Kostrzewa, D., Josiński, H.: The Modified IWO Algorithm for Optimization of Numerical Functions. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) SIDE 2012 and EC 2012. LNCS, vol. 7269, pp. 267–274. Springer, Heidelberg (2012)
Kostrzewa, D., Josiński, H.: Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem. In: 5th International Conference on Agents and Artificial Intelligence (ICAART 2013), pp. 451–456 (2013)
Mehrabian, R., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics 1(4), 355–366 (2006)
Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer (2004)
Steinbrunn, M., Moerkotte, G., Kemper, A.: Heuristic and randomized optimization for the join ordering problem. The VLDB Journal 6, 191–208 (1997)
Tao, G., Michalewicz, Z.: Inver-over Operator for the TSP. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 803–812. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kostrzewa, D., Josiński, H. (2014). The exIWO Metaheuristic – A Recapitulation of the Research on the Join Ordering Problem. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures, and Structures. BDAS 2014. Communications in Computer and Information Science, vol 424. Springer, Cham. https://doi.org/10.1007/978-3-319-06932-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-06932-6_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06931-9
Online ISBN: 978-3-319-06932-6
eBook Packages: Computer ScienceComputer Science (R0)