Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer (1999)
| Venue: | Proc. of ACM SIGMOD Intl. Conf. on Management of Data |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Waas99counting,enumerating,,
author = {Florian Waas and C.A. Galindo-Legaria and Florian Waas and Cesar Galindo-legaria},
title = {Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer},
booktitle = {Proc. of ACM SIGMOD Intl. Conf. on Management of Data},
year = {1999},
pages = {499--509},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects often remain undetected as the query optimizer's choice of an execution plan is not only depending on the query but strongly influenced by a large number of parameters describing the database and the hardware environment. Modifying these parameters in order to steer the optimizer to select other plans is di#cult since this means anticipating often complex search strategies implemented in the optimizer. In this paper we devise algorithms for counting, exhaustive generation, and uniform sampling of plans from the complete search space. Our techniques allow extensive validation of both generation of alternatives, and execution algorithms with plans other than the optimized one---if two candidate plans fail to produce the same results, then either the optimizer considered an invalid plan, or the execution ...
