Optimization of nested SQL queries revisited
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Extensible/rule based query rewrite optimization in Starburst
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Understanding the new SQL: a complete guide
Understanding the new SQL: a complete guide
Optimization of real conjunctive queries
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Containment of conjunctive queries: beyond relations as sets
ACM Transactions on Database Systems (TODS)
Cost-based optimization for magic: algebra and implementation
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reusing invariants: a new strategy for correlated queries
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Performing Group-By before Join
Proceedings of the Tenth International Conference on Data Engineering
Optimizatioin of a Subclass of Conjunctive Queries
ICDT '90 Proceedings of the Third International Conference on Database Theory
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Foundations of Aggregation Constraints
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Magic of Duplicates and Aggregates
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Query Optimization by Predicate Move-Around
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Improved Unnesting Algorithms for Join Aggregate SQL Queries
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Generalized Projections: A Powerful Query-Optimization Technique
Generalized Projections: A Powerful Query-Optimization Technique
Database theory and cylindric lattices
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We present a new optimization method for nested SQL query blocks with aggregation operators. The method is derived from the theory of dependency implication and tableau minimization. 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 or aggregation constraints, and reduces optimization of such query blocks to the well-studied problem of tableau minimization. We prove a completeness result for this algorithm: if two max, min blocks can be merged, the algorithm will detect this fact