SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The EXODUS optimizer generator
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A rule-based view of query optimization
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Grammar-like functional rules for representing query optimization alternatives
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Extensible query processing in starburst
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Advanced query processing in object bases using access support relations
Proceedings of the sixteenth international conference on Very large databases
Queries and query processing in object-oriented database systems
ACM Transactions on Information Systems (TOIS)
Rule-based optimization and query processing in an extensible geometric database system
ACM Transactions on Database Systems (TODS)
A general framework for the optimization of object-oriented queries
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Experiences building the open OODB query optimizer
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Object-oriented database management: applications in engineering and computer science
Object-oriented database management: applications in engineering and computer science
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
An optimal evaluation of Boolean expressions in an online query system
Communications of the ACM
Query Processing for Advanced Database Systems
Query Processing for Advanced Database Systems
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Extending the Search Strategy in a Query Optimizer
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Optimizing Boolean Expressions in Object-Bases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
A Blackboard Architecture for Query Optimization in Object Bases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Control of an Extensible Query Optimizer: A Planning-Based Approach
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
Parallel execution of integrity constraint checks
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Optimizing queries over multimedia repositories
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Query execution techniques for caching expensive methods
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Optimization techniques for queries with expensive methods
ACM Transactions on Database Systems (TODS)
Estimating nested selectivity in object-oriented databases
Proceedings of the ninth international conference on Information and knowledge management
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Optimization and Evaluation of Disjunctive Queries
IEEE Transactions on Knowledge and Data Engineering
Optimizing Queries with Foreign Functions in a Distributed Environment
IEEE Transactions on Knowledge and Data Engineering
Bypassing Joins in Disjunctive Queries
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A graph-theoretic model for optimizing queries involving methods
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing Selections over Datacubes
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Factorizing complex predicates in queries to exploit indexes
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
On the Optimal Ordering of Maps and Selections under Factorization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Predicate result range caching for continuous queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Adaptive execution of variable-accuracy functions
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient processing of complex similarity queries in RDBMS through query rewriting
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Estimating nested selectivity in object-oriented and object-relational databases
Information and Software Technology
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
IEEE Transactions on Knowledge and Data Engineering
The DataPath system: a data-centric analytic processing engine for large data warehouses
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Preference query evaluation over expensive attributes
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Multimedia selection operation placement
Multimedia Tools and Applications
On the optimal ordering of maps, selections, and joins under factorization
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Optimizing queries with expensive video predicates in cloud environment
Concurrency and Computation: Practice & Experience
Distributed and Parallel Databases
Hi-index | 0.00 |
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.