2013 IEEE 29th International Conference on Data Engineering (ICDE) (2010)
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
Nicolas Bruno , Microsoft Corp., USA
Cesar Galindo-Legaria , Microsoft Corp., USA
Milind Joshi , Microsoft Corp., USA
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.
Nicolas Bruno, Cesar Galindo-Legaria, Milind Joshi, "Polynomial heuristics for query optimization", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 589-600, 2010, doi:10.1109/ICDE.2010.5447916