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):

Dayal, Umeshwar
Whang, Kyu-Young
Lomet, David B.
Alonso, Gustavo
Lohman, Guy M.
Kersten, Martin L.
Cha, Sang Kyun
Kim, Young-Kuk
dblp
dblp
dblp
dblp
dblp
dblp
dblp
dblp
Not MPII Editor(s):

Dayal, Umeshwar
Whang, Kyu-Young
Lomet, David B.
Alonso, Gustavo
Lohman, Guy M.
Kersten, Martin L.
Cha, Sang Kyun
Kim, Young-Kuk

BibTeX cite key*:

Neumann2006a

Title, Booktitle

Title*:

Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products

Booktitle*:

Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006)

Event, URLs

URL of the conference:

http://aitrc.kaist.ac.kr/~vldb06

URL for downloading the paper:

http://www.vldb.org/conf/2006/p930-moerkotte.pdf

Event Address*:

Seoul, Korea
Language:

English

Event Date*
(no longer used):


Organization:

Very Large Data Base Endowment Inc.

Event Start Date:

12 September 2006
Event End Date:

15 September 2006

Publisher

Name*:

ACM

URL:

http://www.acm.org

Address*:

New York, USA
Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:

September
Pages:

930-941

Year*:

2006
VG Wort Pages:

30

ISBN/ISSN:

1-59593-385-9
Sequence Number:


DOI:




Note, Abstract, ©

Note:

Acceptance ratio 1:7

(LaTeX) Abstract:

Two approaches to derive dynamic programming algorithms for constructing join trees are described in the literature. We show analytically and experimentally that these two variants exhibit vastly diverging runtime behaviors for different query graphs. More specifically, each variant is superior to the other for one kind of query graph (chain or clique), but fails for the other. Moreover, neither of them handles star queries well. This motivates us to derive an algorithm that is superior to the two existing algorithms because it adapts to the search space implied by the query graph.

URL for the Abstract:

http://portal.acm.org/citation.cfm?id=1164127.1164207&coll=&dl=ACM&CFID=15151515&CFTOKEN=6184618

Keywords:

Query Optimization



Download
Access Level:

Internal

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Audience:

popular

Appearance:

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



BibTeX Entry:

@INPROCEEDINGS{Neumann2006a,
AUTHOR = {Moerkotte, Guido and Neumann, Thomas},
 EDITOR = {Dayal, Umeshwar and Whang, Kyu-Young and Lomet, David B. and Alonso, Gustavo and Lohman, Guy M. and Kersten, Martin L. and Cha, Sang Kyun and Kim, Young-Kuk},
 TITLE = {Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products},
 BOOKTITLE = {Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006)},
 PUBLISHER = {ACM},
 YEAR = {2006},
 ORGANIZATION = {Very Large Data Base Endowment Inc.},
 PAGES = {930--941},
 ADDRESS = {Seoul, Korea},
 MONTH = {September},
 ISBN = {1-59593-385-9},
 NOTE = {Acceptance ratio 1:7},
}

Entry last modified by Martin Theobald, 04/14/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
10/24/2006 11:09:59 AM
Revisions
7.
6.
5.
4.
3.		Editor(s)
Martin Theobald
Martin Theobald
Adriana Davidescu
Ralf Schenkel
Ralf Schenkel		Edit Dates
04/14/2009 03:02:43 PM
04/14/2009 03:01:51 PM
20.07.2007 18:59:42
30.03.2007 16:20:54
13.02.2007 15:09:09