Dynamic Programming: The Next Step

Preview

PDF
main.pdf - Published
Download (610kB)

URL:	https://ub-madoc.bib.uni-mannheim.de/37228
URN:	urn:nbn:de:bsz:180-madoc-372288
Document Type:	Report
Year of publication:	2014
The title of a journal, publication series:	Technical report
Place of publication:	Mannheim
Publication language:	English
Institution:	School of Business Informatics and Mathematics > Practical Computer Science III (Moerkotte 1996-)
Subject:	004 Computer science, internet
Classification:	CCS: H.2.4,
Keywords (English):	Optimization , Plan Generation , Query Processing
Abstract:	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.