1. Chapter 14 An Overview of Query Optimization

2. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-2 Figure 14.1 Typical architecture for DBMS query processing.

3. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-3 Figure 14.2 Query trees for relational expressions (14.3) through (14.6).

4. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-4 Figure 14.2 Query trees for relational expressions (14.3) through (14.6). (cont’d)

5. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-5 Figure 14.3 Query execution plans for relational expressions (14.3) through (14.6).

6. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-6 Figure 11.4 Query execution plans for relational expressions (14.3) through (14.6). (cont’d)

7. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-7 Figure 14.4 Transforming a query tree into a logical query execution plan.

8. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-8 Figure 14.5 Logical plan and three equivalent query trees.

9. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-9 Figure 14.5 Logical plan and three equivalent query trees. (cont’d)

10. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-10 Figure 14.6 Heuristic search of the query execution plan space.