Optimizing disjunctive queries with expensive predicates
Authors:
Open Access
- 24 May 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 23 (2) , 336-347
Abstract
In this work, we propose and assess a technique called bypass processing for optimizing the evaluation of disjunctive queries with expensive predicates. The technique is particularly useful for optimizing selection predicates that contain terms whose evaluation costs vary tremendously; e.g., the evaluation of a nested subquery or the invocation of a user-defined function in an object-oriented or extended relational model may be orders of magnitude more expensive than an attribute access (and comparison). The idea of bypass processing consists of avoiding the evaluation of such expensive terms whenever the outcome of the entire selection predicate can already be induced by testing other, less expensive terms. In order to validate the viability of bypass evaluation, we extend a previously developed optimizer architecture and incorporate three alternative optimization algorithms for generating bypass processing plans.Keywords
This publication has 14 references indexed in Scilit:
- A general framework for the optimization of object-oriented queries1992
- Rule-based optimization and query processing in an extensible geometric database systemACM Transactions on Database Systems, 1992
- Queries and query processing in object-oriented database systemsACM Transactions on Information Systems, 1990
- Extensible query processing in starburst1989
- Grammar-like functional rules for representing query optimization alternatives1988
- The EXODUS optimizer generator1987
- Query Optimization in Database SystemsACM Computing Surveys, 1984
- Sequencing with Series-Parallel Precedence ConstraintsMathematics of Operations Research, 1979
- Access path selection in a relational database management system1979
- An optimal evaluation of Boolean expressions in an online query systemCommunications of the ACM, 1977