Created by W.Langdon from gp-bibliography.bib Revision:1.7989
Read only queries, join. 3 mutations reorder SQL select/join statements, delete join statements, change join type.
Aim minimise number of rows returned by join.
Testing. Representative databases, but bigger database means heavier load on computer and network. Multiobjective. Test the program not the query. Faster query can still give same result.
Video nqBWLbtq6yQ James Callan
1:47 Discussion: Chair: Bobby R. Bruce (balck). Answers: James Callan(green) and Justyna Petke (red).
2:19 Q: W. B. Langdon GI versus conventional SQL query optimisation? A: James Callan existing join order optimisation done at run time and can go wrong. Offline GI query optimisation may be more effective. Database may be over engineered, eg too many columns in table. GI has more scope to get desired result, ie freedom to not replicate query exactly.
3:40 Q: Myra B. Cohen. A: GI good as can adapt as database moves over times.
4:22 Q: Alexandre Bergel, genetic programming. A: GI applicable to long and complex queries as seen in existing human written queries
5:43 Q: Westley Weimer, fitness over fitting. A: Most useful on large table and complex queries, ideally an SQL query which is used multiple times in a program.
6:54 Q: Giovani Guizzo, swapping join with where?
7:38 Q: Westley Weimer, map SQL back into relational algebra, mutate/edit in relational algebra and then transform patches into SQL. A: James Callan A: Justyna Petke motivation integration into existing or extended GI tools.
9:44 Q: Bobby R. Bruce, multi-objective. A: James Callan query time and size of result (bandwidth usage)
part of \cite{Petke:2021:ICSEworkshop} http://geneticimprovementofsoftware.com/events/icse2021.html",
Genetic Programming entries for James Callan Justyna Petke