Since 2013, dynamic programming (DP)-based plan generators are capable of
correctly reordering not only inner joins, but also outer joins. Now, we consider the
next big step: reordering not only joins, but also joins and grouping. Since only
reorderings of grouping with inner joins are known, we first develop equivalences
which allow reordering of grouping with outer joins. Then, we show how to extend a
state-of-the-art DP-based plan generator to fully explore these new plan alternatives.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.
![[img]](https://madoc.bib.uni-mannheim.de/style/images/fileicons/application_pdf.png)
Suche Autoren in