#query-processing

3 notes

# Dbms

Traces a query's path from parsing through optimization to execution, and how to read an execution plan.

Covers cost-based and rule-based optimization, join ordering, and predicate/projection pushdown.

Compares nested loop, block nested loop, index nested loop, merge join, and hash join algorithms and when the optimizer picks each.