English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Generating Optimal DAG-structured Query Evaluation Plans

Neumann, T., & Moerkotte, G. (2009). Generating Optimal DAG-structured Query Evaluation Plans. Computer Science - Research and Development, 24(3), 103-117. doi:10.1007/s00450-009-0061-0.

Item is

Files

show Files
hide Files
:
fulltext.pdf (Any fulltext), 742KB
 
File Permalink:
-
Name:
fulltext.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: In many database queries relations are access multiple times during query processing. In these cases query processing can be accelerated by sharing scan operators and possibly other operators based upon the common relations. The standard approach to achieve sharing works as follows. In a first phase, a non-shared tree-shaped plan is generated via a traditional plan generator. In a second phase, common instances of a scan are detected and shared. After that, other possible operators are shared. The result is an operator DAG (directed acyclic graph). The limitation of this approach is obvious. 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 this situation by (1) introducing a general framework for reasoning about sharing and (2) sketching how this framework can be integrated into a plan generator, which then constructs optimal DAG-structured query evaluation plans.

Details

show
hide
Language(s): eng - English
 Dates: 20092009
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 520385
DOI: 10.1007/s00450-009-0061-0
URI: http://www.springerlink.com/content/p402526l2q41614u/fulltext.pdf
Other: Local-ID: C1256DBF005F876D-5EA18346FFA3696BC12576A5005C45DD-NeumannCSRD2009
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Computer Science - Research and Development
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 24 (3) Sequence Number: - Start / End Page: 103 - 117 Identifier: ISSN: 1865-2034