Skip to main content
Article thumbnail
Location of Repository

Optimization of Nested SQL Queries by Tableau Equivalence (Extended Abstract)

By Vasilis Aggelis and Stavros Cosmadakis

Abstract

) Vasilis Aggelis University of Patras aggelisv@otenet.gr Stavros Cosmadakis University of Patras scosmada@cti.gr Phone: 30-61-997867 Fax: 30-61-991650 Abstract We present a new optimization method for nested SQL query blocks with aggregation operators. The method is derived from the theory of dependency implication. It unifies and generalizes previously proposed (seemingly unrelated) algorithms, and can incorporate general database dependencies given in the database schema. We apply our method to query blocks with max, min aggregation operators. We obtain an algorithm which does not infer arithmetical constraints, and reduces optimization of such query blocks to the well-studied problem of tableau equivalence. We prove a completeness result for this algorithm: if two max, min blocks can be merged, the algorithm will detect this fact. 1 Introduction The practical importance of optimizing queries in relational database systems has been recognized. Traditional systems..

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.41.2739
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.dcs.gla.ac.uk/dbpl9... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.