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:




Library Locked Library locked




Author, Editor

Author(s):

Neumann, Thomas
Moerkotte, Guido

dblp
dblp

Not MPG Author(s):

Moerkotte, Guido

Editor(s):

Freytag, Johann Christoph
Ruf, Thomas
Lehner, Wolfgang
Vossen, Gottfried

dblp
dblp
dblp
dblp

Not MPII Editor(s):

Freytag, Johann Christoph
Ruf, Thomas
Lehner, Wolfgang
Vossen, Gottfried

BibTeX cite key*:

Neumann2009BTW

Title, Booktitle

Title*:

A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator

Booktitle*:

Datenbanksysteme in Business, Technologie und Web (BTW 2009) : 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS)

Event, URLs

URL of the conference:

http://btw2009.uni-muenster.de/

URL for downloading the paper:


Event Address*:

Münster, Germany

Language:

English

Event Date*
(no longer used):


Organization:

Gesellschaft für Informatik (GI)

Event Start Date:

2 March 2009

Event End Date:

6 March 2009

Publisher

Name*:

GI

URL:


Address*:

Bonn, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Informatics

Volume:

144

Number:


Month:

March

Pages:

7-26

Year*:

2009

VG Wort Pages:

35

ISBN/ISSN:

978-3-88579-238-3

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Very recently, Cao et al.\ presented the MAPLE approach,
which accelerates queries with multiple instances of the same relation
by sharing their scan operator.
The principal idea is to derive, in a first phase,
a non-shared tree-shaped plan via a traditional plan generator.
In a second phase, common instances of a scan are detected and shared
by turning the operator tree into an operator DAG (directed acyclic graph).

The limits of their approach are obvious.
(1) Sharing more than scans is often possible and can lead to considerable
performance benefits.
(2) As sharing influences plan costs, a separation of the optimization into
two phases comprises the danger of missing the optimal plan,
since the first optimization phase does not know about sharing.

We remedy both points by introducing a general framework for reasoning
about sharing: plans can be shared whenever they are {\em share equivalent} and
not only if they are scans of the same relation.
Second, we sketch how this framework can be integrated into a plan generator,
which then constructs optimal DAG-structured plans.

Keywords:

query optimization



Download
Access Level:

Institute

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Appearance:

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



BibTeX Entry:

@INPROCEEDINGS{Neumann2009BTW,
AUTHOR = {Neumann, Thomas and Moerkotte, Guido},
EDITOR = {Freytag, Johann Christoph and Ruf, Thomas and Lehner, Wolfgang and Vossen, Gottfried},
TITLE = {A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator},
BOOKTITLE = {Datenbanksysteme in Business, Technologie und Web (BTW 2009) : 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS)},
PUBLISHER = {GI},
YEAR = {2009},
ORGANIZATION = {Gesellschaft für Informatik (GI)},
VOLUME = {144},
PAGES = {7--26},
SERIES = {Lecture Notes in Informatics},
ADDRESS = {M{\"u}nster, Germany},
MONTH = {March},
ISBN = {978-3-88579-238-3},
}


Entry last modified by Anja Becker, 03/23/2010
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)
[Library]
Created
03/23/2009 04:19:04 PM
Revisions
3.
2.
1.
0.
Editor(s)
Anja Becker
Thomas Neumann
Martin Theobald
Thomas Neumann
Edit Dates
23.03.2010 13:11:29
08.01.2010 16:53:59
04/15/2009 02:04:58 PM
03/23/2009 04:19:04 PM