English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator

Neumann, T., & Moerkotte, G. (2009). A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator. In J. C. Freytag, T. Ruf, W. Lehner, & G. Vossen (Eds.), Datenbanksysteme in Business, Technologie und Web (BTW 2009), 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS) (pp. 7-26). Bonn: GI.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-18F5-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-3774-C
Genre: Conference Paper

Files

show Files
hide Files
:
optimizingdags.pdf (Any fulltext), 279KB
 
File Permalink:
-
Name:
optimizingdags.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Neumann, Thomas1, Author           
Moerkotte, Guido2, Author
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2009
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 520395
Other: Local-ID: C1256DBF005F876D-8A7DE2804C156572C1257582005424A8-Neumann2009BTW
 Degree: -

Event

show
hide
Title: 13. Fachtagung des GI-Fachbereichs Datenbanken und Informationssysteme
Place of Event: Münster, Germany
Start-/End Date: 2009-03-02 - 2009-03-06

Legal Case

show

Project information

show

Source 1

show
hide
Title: Datenbanksysteme in Business, Technologie und Web (BTW 2009), 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS)
Source Genre: Proceedings
 Creator(s):
Freytag, Johann Christoph1, Editor
Ruf, Thomas1, Editor
Lehner, Wolfgang1, Editor
Vossen, Gottfried1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Bonn : GI
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 7 - 26 Identifier: ISBN: 978-3-88579-238-3

Source 2

show
hide
Title: Lecture Notes in Informatics
  Abbreviation : LNI
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 144 Sequence Number: - Start / End Page: - Identifier: -