Query Optimization by Predicate Move-Around

Query optimization which is done by making a graph of the query and moving predicates around in the graph so that they will be applied early in the optimized query generated from the graph. Predicates are first propagated up from child nodes of the graph to parent nodes and then down into different child nodes. After the predicates have been moved, redundant predicates are detected and removed. Predicates are moved through aggregation operations and new predicates are deduced from aggregation operations and from functional dependencies. The optimization is not dependent on join order and works where nodes of the graph cannot be merged.

[1]  Umeshwar Dayal,et al.  Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers , 1987, VLDB.

[2]  S. Sudarshan,et al.  Aggregation and Relevance in Deductive Databases , 1991, VLDB.

[3]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[4]  Hamid Pirahesh,et al.  Extensible/rule based query rewrite optimization in Starburst , 1992, SIGMOD '92.

[5]  Kenneth A. Ross,et al.  Foundations of Aggregation Constraints , 1994, PPCP.

[6]  Divesh Srivastava,et al.  Pushing constraint selections , 1992, J. Log. Program..

[7]  Baile Shi,et al.  Query Optimization in a Knowledge Base System , 1992, Future Databases.

[8]  Michael Stonebraker,et al.  Predicate migration: optimizing queries with expensive predicates , 1992, SIGMOD Conference.

[9]  Alon Y. Halevy,et al.  Constraints and redundancy in datalog , 1992, PODS.

[10]  PiraheshHamid,et al.  Implementation of magic-sets in a relational database system , 1994 .

[11]  Hamid Pirahesh,et al.  Implementation of magic-sets in a relational database system , 1994, SIGMOD '94.

[12]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[13]  Joseph M. Hellerstein,et al.  Practical predicate placement , 1994, SIGMOD '94.

[14]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[15]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[16]  Harry K. T. Wong,et al.  Optimization of nested SQL queries revisited , 1987, SIGMOD '87.

[17]  Won Kim,et al.  On optimizing an SQL-like nested query , 1982, TODS.

[18]  Steve Talbot.  An Investigation into Logical Optimization of Relational Query Languages , 1984, Comput. J..

[19]  Hamid Pirahesh,et al.  Magic is relevant , 1990, SIGMOD '90.

[20]  M. Muralikrishna,et al.  Improved Unnesting Algorithms for Join Aggregate SQL Queries , 1992, VLDB.

[21]  Alon Y. Halevy,et al.  Equivalence, query-reachability and satisfiability in Datalog extensions , 1993, PODS '93.

[22]  Hamid Pirahesh,et al.  Magic conditions , 1990, PODS.