From da3594bb4cb4a4969a543633fc61b8f3e9039bc9 Mon Sep 17 00:00:00 2001 From: Oliver Kennedy Date: Wed, 7 Feb 2018 11:35:27 -0500 Subject: [PATCH] Tweaking slides --- slides/cse4562sp2018/2018-02-07-RA-Equivs.html | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/slides/cse4562sp2018/2018-02-07-RA-Equivs.html b/slides/cse4562sp2018/2018-02-07-RA-Equivs.html index 87ad30d0..47ce2269 100644 --- a/slides/cse4562sp2018/2018-02-07-RA-Equivs.html +++ b/slides/cse4562sp2018/2018-02-07-RA-Equivs.html @@ -451,16 +451,16 @@

General Query Optimizers

    -
  1. Apply blind heuristics: e.g., push down selections
    2. -
  2. Enumerate all possible execution plans: (or for a reasonable subset) +
  3. Apply blind heuristics (e.g., push down selections)
    4. +
  4. Enumerate all possible execution plans by varying (or for a reasonable subset)
      -
    • Join/Union evaluation order (commutativity, associativity, distributivity)
      • -
    • Join algorithms (also Aggregation, Sort, Distinct, and others)
      • -
    • Data access paths
      • +
    • Join/Union Evaluation Order (commutativity, associativity, distributivity)
      • +
    • Algorithms for Joins, Aggregates, Sort, Distinct, and others
      • +
    • Data Access Paths
    5. -
  5. Estimate the cost of each execution plan
    6. -
  6. Pick the execution plan with the lowest cost
    7. +
  7. Estimate the cost of each execution plan
    8. +
  8. Pick the execution plan with the lowest cost