Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  Dynamic Programming Strikes Back

Moerkotte, G., & Neumann, T. (2008). Dynamic Programming Strikes Back. In D. Shasha, & J. T. L. Wang (Eds.), Proceedings of the ACM SIGMOD 2008 International Conference on Management of Data (pp. 539-552). New York, NY: ACM.

Item is

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Moerkotte, Guido, Autor
Neumann, Thomas1, Autor           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Two highly efficient algorithms are known for optimally ordering joins while avoiding cross products: DPccp, which is based on dynamic programming, and Top-Down Partition Search, based on memoization. Both have two severe limitations: They handle only (1) simple (binary) join predicates and (2) inner joins. However, real queries may contain complex join predicates, involving more than two relations, and outer joins as well as other non-inner joins. Taking the most efficient known join-ordering algorithm, DPccp, as a starting point, we first develop a new algorithm, DPhyp, which is capable to handle complex join predicates efficiently. We do so by modeling the query graph as a (variant of a) hypergraph and then reason about its connected subgraphs. Then, we present a technique to exploit this capability to efficiently handle the widest class of non-inner joins dealt with so far. Our experimental results show that this reformulation of non-inner joins as complex predicates can improve optimization time by orders of magnitude, compared to known algorithms dealing with complex join predicates and non-inner joins. Once again, this gives dynamic programming a distinct advantage over current memoization techniques.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2009-03-262008
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 428168
DOI: 10.1145/1376616.1376672
URI: http://doi.acm.org/10.1145/1376616.1376672
Anderer: Local-ID: C125756E0038A185-DCA408A1A5CF641AC12574F7004C26D7-Neumann2008a
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: SIGMOD 2008
Veranstaltungsort: Vancouver, Canada
Start-/Enddatum: 2008-06-09 - 2008-06-12

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the ACM SIGMOD 2008 International Conference on Management of Data
Genre der Quelle: Konferenzband
 Urheber:
Shasha, Dennis, Herausgeber
Wang, Jason T. L., Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: New York, NY : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 539 - 552 Identifikator: ISBN: 978-1-60558-102-6