Chapter 11. Query Optimization
In this chapter, we will cover the following recipes:
Using sample data sets
Timing overhead
Studying hot and cold cache behavior
Clearing the cache
Querying plan node structure
Generating an explain plan
Computing basic costs
Running sequential scans
Running bitmap heap and index scans
Aggregate and hash aggregate
Grouping
Working with set operations
Running a CTE scan
Nesting loops
Working with merge and hash join
Working on semi and anti joins