Query optimization by simulated annealing
SIGMOD '87 Proceedings of the 1987 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
Randomized algorithms for query optimization
Randomized algorithms for query optimization
ML for the working programmer (2nd ed.)
ML for the working programmer (2nd ed.)
Object Database Standard: ODMG-93, Release 1.2
Object Database Standard: ODMG-93, Release 1.2
Genetic Search: Analysis Using Fitness Moments
IEEE Transactions on Knowledge and Data Engineering
On the Ordering of Rewrite Rules (Extended Abstract)
ADBIS '98 Proceedings of the Second East European Symposium on Advances in Databases and Information Systems
Query Evaluation in CROQUE - Calculus and Algebra Coincide
BNCOD 15 Proceedings of the 15th British National Conferenc on Databases: Advances in Databases
Query Optimization in the CROQUE Project
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
Incremental Updates for Materialized OQL Views
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
The Volcano Optimizer Generator: Extensibility and Efficient Search
Proceedings of the Ninth International Conference on Data Engineering
| Hi-index | 0.00 |
In query optimization, a given query will be transformed by rewrite rules into an equivalent execution plan that is cheaper than the straightforwardly assigned plan according to some cost model. Finding the cheapest of all equivalent execution plans is a challenge since the rewriting of complex queries on the basis of a large set of rewriting rules may potentially span a very large space of equivalent plans. Consequently, one has to either use search strategies to explore (parts of) the search space or some heuristics to prune this space thus making it efficiently traversable. This paper presents the use of search strategies in the CROQUE project. The adaptation of some common strategies led to the development of a simple but powerful heuristics which is demonstrated by examples executed in the CROQUE prototype. The proposed heuristics can support any random-based search strategy or can be used stand-alone. It may be integrated seamlessly into most of the present query optimizers without almost any effort.