| Cost Distributions of Search Spaces in Query Optimization (2007) | |||||||||||||||||
Abstract | |||||||||||||||||
| Query optimization algorithms explore a large space of query execution plans looking for an optimal solution. The predominant algorithms move around the search space in either a deterministic or probabilistic way. The performance of probabilistic optimization algorithms is strongly influenced by the cost distribution over the search space, the connectivity of the space and the overhead cost. The transformation free (TF) Query Optimization strategy proposed in this paper is insensitive to the search space connectivity. We show that under weak conditions and the assumption of an accurate cost model the performance and accuracy of the TF strategy in comparable with probabilistic strategies. | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||