【COMP207 LEC19】

LEC 19

Optimize Query Plans 

>> #1: Push selections as far down the tree as possible

这可以更早的排除更多不相关的内容

>>#2:  Insert projections where appropriate

>> #3: If possible, introduce equijoins for × followed by σ

 

Select physical query plan

会选取一个lowest cost estimate 的 physical query plan，所以我们需要先estimate the cost of execution

Estimating the Cost of Execution

>>  Number of disk access operations 磁盘访问次数

1. Selection of algorithms for the individual operators

2. Method for passing information

3. Size of intermediate results

>> Estimated from parameters of the database 根据数据库的参数

1. Size of relations

2. Number of distinct items per attribute per relation

Estimating the Size of a Selection：

例：

>> Other selection

1. Selection of a suitable algorithm for each operator based on size of intermediate result

2. Selection of a good join order also based on size of intermediate results