Polynomial Heuristics for Query Optimization

被引：20

作者：

Bruno, Nicolas ^{[1
]}

Galindo-Legaria, Cesar ^{[1
]}

Joshi, Milind ^{[1
]}

机构：

[1] Microsoft Corp, Redmond, WA 98052 USA

来源：

26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING ICDE 2010 | 2010年

关键词：

D O I：

10.1109/ICDE.2010.5447916

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：589 / 600

页数：12