) Vasilis Aggelis University of Patras email@example.com Stavros Cosmadakis University of Patras firstname.lastname@example.org 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..
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.