English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Query Simplification: Graceful Degradation for Join-Order Optimization

Neumann, T. (2009). Query Simplification: Graceful Degradation for Join-Order Optimization. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data (pp. 403-414). New York, NY: ACM.

Item is

Files

show Files
hide Files
:
querysimplification.pdf (Any fulltext), 302KB
 
File Permalink:
-
Name:
querysimplification.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           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 Abstract: Join ordering is one of the most important, but also most challenging problems of query optimization. In general finding the optimal join order is NP-hard. Existing dynamic programming algorithms exhibit exponential runtime even for the restricted, but highly relevant class of star joins. Therefore, it is infeasible to find the optimal join order when the query includes a large number of joins. Existing approaches for large queries switch to greedy heuristics or randomized algorithms at some point, which can degrade query execution performance by orders of magnitude. We propose a new paradigm for optimizing large queries: when a query is too complex to be optimized exactly, we simplify the query's join graph until the optimization problem becomes tractable within a given time budget. During simplification, we apply safe simplifications before more risky ones. This way join ordering problems are solved optimally if possible, and gracefully degrade with increasing query complexity. This paper presents a general framework for query simplification and a strategy for directing the simplification process. Extensive experiments with different kinds of queries, different join-graph structures, and different cost functions indicate that query simplification is very robust and outperforms previous methods for join-order optimization.

Details

show
hide
Language(s): eng - English
 Dates: 2010-01-262009
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 520391
Other: Local-ID: C1256DBF005F876D-AC993E6397070B1AC12575820054C7B8-Neumann2009SIGMODa
 Degree: -

Event

show
hide
Title: 2009 ACM SIGMOD International Conference on Management of Data
Place of Event: Providence, USA
Start-/End Date: 2009-06-29 - 2009-07-02

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data
  Abbreviation : SIGMOD 2009
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 403 - 414 Identifier: ISBN: 978-1-60558-554-3