Overview
Explore the intricacies of query optimizer implementations in this advanced database systems lecture from Carnegie Mellon University. Delve into topics such as logical and physical plans, algebra equivalencies, cost model assessment, and design decisions in query optimization. Learn about different approaches to query optimization, including cost-based search, bottom-up search, and random algorithms. Gain insights from Professor Andy Pavlo on prepared statements, plan stability, and when to stop searching for optimal query plans. Examine specific implementations in systems like PostgreSQL and understand the trade-offs involved in various optimization techniques.
Syllabus
Intro
Query Optimizer
Whats Next
Background
Overview
Logical Plan Physical Plan
Algebra Equivalencies
Optimal Physical Plan
Cost Model Assessment
Design Decisions
Query Optimizer Scope
Prepared Statements
Plan Stability
When to Stop Searching
Different Approaches
Simplest Approach
Magic Constants
CostBased Search
Bottoms Up Search
Aggregation
Postgres
Random Algorithm
simulated annealing
link
Taught by
CMU Database Group