Efficient generation of query plans containing group-by, join, and groupjoin
Eich, Marius
;
Fender, Pit
;
Moerkotte, Guido
DOI:
|
https://doi.org/10.1007/s00778-017-0476-3
|
URL:
|
https://link.springer.com/article/10.1007/s00778-0...
|
Weitere URL:
|
https://www.semanticscholar.org/paper/Efficient-ge...
|
Dokumenttyp:
|
Zeitschriftenartikel
|
Erscheinungsjahr:
|
2018
|
Titel einer Zeitschrift oder einer Reihe:
|
The VLDB Journal
|
Band/Volume:
|
27
|
Heft/Issue:
|
5
|
Seitenbereich:
|
617-641
|
Ort der Veröffentlichung:
|
Berlin ; Heidelberg
|
Verlag:
|
Springer
|
ISSN:
|
1066-8888 , 0949-877X
|
Sprache der Veröffentlichung:
|
Englisch
|
Einrichtung:
|
Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik > Practical Computer Science III (Moerkotte 1996-)
|
Fachgebiet:
|
004 Informatik
|
Abstract:
|
It has been a recognized fact for many years that query execution can benefit from pushing grouping operators down in the operator tree and applying them before a join. This so-called eager aggregation reduces the size(s) of the join argument(s), making join evaluation faster. Lately, the idea enjoyed a revival when it was applied to outer joins for the first time and incorporated in a state-of-the-art plan generator. However, the recent approach is highly dependent on the use of heuristics because of the exponential growth of the search space that goes along with eager aggregation. Finding an optimal solution for larger queries calls for effective optimality-preserving pruning mechanisms to reduce the search space size as far as possible. By a more thorough investigation of functional dependencies and keys, we provide a set of new pruning criteria and extend the idea of eager aggregation further by combining it with the introduction of groupjoins. We evaluate the resulting plan generator with respect to runtime and memory consumption.
|
| Dieser Eintrag ist Teil der Universitätsbibliographie. |
Suche Autoren in
Sie haben einen Fehler gefunden? Teilen Sie uns Ihren Korrekturwunsch bitte hier mit: E-Mail
Actions (login required)
|
Eintrag anzeigen |
|
|