Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Moerkotte, Guido
Neumann, Thomas

dblp
dblp

Not MPG Author(s):

Moerkotte, Guido

Editor(s):

Wang, Jason Tsong-Li

dblp

Not MPII Editor(s):

Wang, Jason Tsong-Li

BibTeX cite key*:

Neumann2008a

Title, Booktitle

Title*:

Dynamic Programming Strikes Back


dphyper.pdf (426.64 KB)

Booktitle*:

Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2008)

Event, URLs

URL of the conference:

http://www.sigmod08.org

URL for downloading the paper:


Event Address*:

Vancouver, Canada

Language:

English

Event Date*
(no longer used):


Organization:

Association for Computing Machinery (ACM)

Event Start Date:

9 June 2008

Event End Date:

12 June 2008

Publisher

Name*:

ACM

URL:


Address*:

New York, NY, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:

June

Pages:

539-552

Year*:

2008

VG Wort Pages:

38

ISBN/ISSN:

978-1-60558-102-6

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

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.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Neumann2008a,
AUTHOR = {Moerkotte, Guido and Neumann, Thomas},
EDITOR = {Wang, Jason Tsong-Li},
TITLE = {Dynamic Programming Strikes Back},
BOOKTITLE = {Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2008)},
PUBLISHER = {ACM},
YEAR = {2008},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PAGES = {539--552},
ADDRESS = {Vancouver, Canada},
MONTH = {June},
ISBN = {978-1-60558-102-6},
}


Entry last modified by Martin Theobald, 04/20/2009
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Thomas Neumann
Created
11/04/2008 02:51:46 PM
Revisions
2.
1.
0.

Editor(s)
Martin Theobald
Thomas Neumann
Thomas Neumann

Edit Dates
04/20/2009 02:28:29 PM
11/18/2008 12:36:41 PM
11/04/2008 02:51:46 PM

Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
dphyper.pdf