A state transition model for distributed query processing
ACM Transactions on Database Systems (TODS)
Query graphs, implementing trees, and freely-reorderable outerjoins
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
Algebraic optimization of outerjoin queries
Algebraic optimization of outerjoin queries
Hypergraph based reorderings of outer join queries with complex predicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Processing queries with quantifiers a horticultural approach
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
An extended relational algebra with control over duplicate elimination
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
How to Extend a Conventional Optimizer to Handle One- and Two-Sided Outerjoin
Proceedings of the Eighth International Conference on Data Engineering
VLDB '87 Proceedings of the 13th 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
No regression algorithm for the enumeration of projections in SQL queries with joins and outer joins
CASCON '95 Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
SQL query optimization: reordering for a general class of queries
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
No regression algorithm for the enumeration of projections in SQL queries with joins and outer joins
CASCON '95 Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
Hi-index | 0.00 |
The execution time of an SQL query can be reduced significantly by considering different schedules for the operations specified in the query. The benefits of considering different schedules, a hallmark of strength in query optimization, are not usually exploited if a query contains projections along with binary operations. This paper presents a set of "no regression" algorithms that are capable of generating different schedules for the queries containing projections and binary operations.