Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
An optimal evaluation of Boolean expressions in an online query system
Communications of the ACM
Optimizing the performance of a relational algebra database interface
Communications of the ACM
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Common expression analysis in database applications
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
An architecture for query optimization
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Accurate estimation of the number of tuples satisfying a condition
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
In a relational database management system (DBMS), query optimization is essential since the DBMS must produce candidate internal access strategies from a high level query and select the optimal one. The goals of inplementing a good optimization mechanism are: (a) to maximize the performance of selected access strategies and (b) to minimize the optimization overhead. We have developed an optimization mechanisin, built it in a relational DBMS product at Hitachi. The mechanism can estimate precise tuple selectivity of predicates in queries for optimal access strategy selection, and employs a new method, called the cascade method, for optimization overhead reduction. This paper also proposes a global optimization mechanisn which executes optimization over multiple database queries.