Polynomial Heuristics for Query Optimization

  • Nico Bruno ,
  • Cesar Galindo-Legaria ,
  • Milind Joshi

International Conference on Data Engineering (ICDE) |

Published by IEEE

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.