diff --git a/slides/cse4562sp2018/2018-02-07-RA-Equivs.html b/slides/cse4562sp2018/2018-02-07-RA-Equivs.html index d7497daf..10a4f8af 100644 --- a/slides/cse4562sp2018/2018-02-07-RA-Equivs.html +++ b/slides/cse4562sp2018/2018-02-07-RA-Equivs.html @@ -448,6 +448,20 @@

Some rewrites are situational... we need more information to decide when to apply them.

+
+

General Query Optimizers

+
    +
  1. Push down selections (and optionally projections)
    2. +
  2. For each valid join ordering: (or for a reasonable subset) +
      +
    1. Figure out the best join algorithms and access paths
      2. +
    2. Estimate the cost of the resulting execution plan
      3. +
    +
    3. +
  3. Pick the execution plan with the lowest cost
    4. +
+
+
Next Class: Extended Relational Algebra and Basic Join Algorithms