Predicate migration
Joseph M. Hellerstein, Michael R Stonebraker · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1993
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers by “predicate pushdown” rules, which apply restrictions in some random order before as many joins as possible. These rules work under the assumption that restriction is essentially a zero-time operation. However, today's extensible and object-oriented database systems allow users to define time-consuming functions, which may be used in a query's restriction and join predicates. Furthermore, SQL has long supported subquery predicates, which may be arbitrarily time-consuming to check. Thus restrictions should not be considered zero-time operations, and the model of query optimization must be enhanced.
Cited by 272 works. doi:10.1145/170035.170078
Authors
References
- Access path selection in a relational database management system
- Principles of database and knowledge-base systems
- Various optimizers for single‐stage production
- The design of POSTGRES
- The SEQUOIA 2000 storage benchmark
- Research directions in object-oriented programming
- The design of POSTGRES
- Extensible/rule based query rewrite optimization in Starburst
- Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers
- Statistical estimators for relational algebra expressions