Polynomial heuristics for query optimization


Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization are restricted in several ways, such as by either focusing on join predicates only, ignoring the availability of indexes, or in general having high-degree polynomial complexity. In this paper we propose a heuristic approach to very efficiently obtain execution plans for complex queries, which takes into account the presence of indexes and goes beyond simple join reordering. We also introduce a realistic workload generator and validate our approach using both synthetic and real data.

DOI: 10.1109/ICDE.2010.5447916

Extracted Key Phrases

14 Figures and Tables

Cite this paper

@article{Bruno2010PolynomialHF, title={Polynomial heuristics for query optimization}, author={Nicolas Bruno and C{\'e}sar A. Galindo-Legaria and Milind Joshi}, journal={2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)}, year={2010}, pages={589-600} }