The exIWO Metaheuristic - A Recapitulation of the Research on the Join Ordering Problem

Daniel Kostrzewa; Henryk Josiński

doi:10.1007/978-3-319-06932-6_2

The exIWO Metaheuristic - A Recapitulation of the Research on the Join Ordering Problem

Future Processing

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Citations (Scopus)

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.

Original language	English
Title of host publication	Beyond Databases, Architectures and Structures - 10th International Conference, BDAS 2014, Proceedings
Publisher	Springer Verlag
Pages	10-19
Number of pages	10
ISBN (Print)	9783319069319
DOIs	https://doi.org/10.1007/978-3-319-06932-6_2
Publication status	Published - 2014

Publication series

Name	Communications in Computer and Information Science
Volume	424
ISSN (Print)	1865-0929

Keywords

database query optimization
exIWO algorithm
join ordering problem
query graph

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1007/978-3-319-06932-6_2

Cite this

Kostrzewa, D., & Josiński, H. (2014). The exIWO Metaheuristic - A Recapitulation of the Research on the Join Ordering Problem. In Beyond Databases, Architectures and Structures - 10th International Conference, BDAS 2014, Proceedings (pp. 10-19). (Communications in Computer and Information Science; Vol. 424). Springer Verlag. https://doi.org/10.1007/978-3-319-06932-6_2

@inproceedings{26a15c272732437ba5d1abd1cee356d1,

title = "The exIWO Metaheuristic - A Recapitulation of the Research on the Join Ordering Problem",

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.",

keywords = "database query optimization, exIWO algorithm, join ordering problem, query graph",

author = "Daniel Kostrzewa and Henryk Josi{\'n}ski",

year = "2014",

doi = "10.1007/978-3-319-06932-6\_2",

language = "English",

isbn = "9783319069319",

series = "Communications in Computer and Information Science",

publisher = "Springer Verlag",

pages = "10--19",

booktitle = "Beyond Databases, Architectures and Structures - 10th International Conference, BDAS 2014, Proceedings",

address = "Germany",

}

The exIWO Metaheuristic - A Recapitulation of the Research on the Join Ordering Problem. / Kostrzewa, Daniel ; Josiński, Henryk.
Beyond Databases, Architectures and Structures - 10th International Conference, BDAS 2014, Proceedings. Springer Verlag, 2014. p. 10-19 (Communications in Computer and Information Science; Vol. 424).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The exIWO Metaheuristic - A Recapitulation of the Research on the Join Ordering Problem

AU - Kostrzewa, Daniel

AU - Josiński, Henryk

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - database query optimization

KW - exIWO algorithm

KW - join ordering problem

KW - query graph

UR - https://www.scopus.com/pages/publications/84903469166

U2 - 10.1007/978-3-319-06932-6_2

DO - 10.1007/978-3-319-06932-6_2

M3 - Conference contribution

AN - SCOPUS:84903469166

SN - 9783319069319

T3 - Communications in Computer and Information Science

SP - 10

EP - 19

BT - Beyond Databases, Architectures and Structures - 10th International Conference, BDAS 2014, Proceedings

PB - Springer Verlag

ER -

The exIWO Metaheuristic - A Recapitulation of the Research on the Join Ordering Problem

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this