BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Software Engineering

860What is Normalization?
861The Normal Forms (1NF, 2NF, 3NF)
862Boyce-Codd Normal Form (BCNF)
863Higher Normal Forms (4NF, 5NF)
864The Cost of Over-Normalization
865Strategic Denormalization
866Denormalization Patterns
867Maintaining Consistency in Denormalized Data
868Balancing Normalization and Performance
869What Indexes Are and How They Work
870The Cost of Indexes: Storage and Write Performance
871Identifying Columns to Index
872Primary Key and Unique Indexes
873Composite Indexes and Column Order
874Covering Indexes
875Index Selectivity and Cardinality
876Partial and Filtered Indexes
877Index Maintenance and Statistics
878Using Query Execution Plans to Validate Indexes
879Understanding Query Execution Plans
880Index Selection and Coverage
881Filtering and Predicate Pushdown
882Join Order and Join Algorithms
883Avoiding N+1 Query Problems
884Query Rewriting for Performance
885Statistics and Query Planning
886Pagination and Large Result Sets
887Query Performance Testing and Monitoring
888Why Schema Evolution Is Inevitable
889Forward-Only Migration Philosophy
890Versioning Schema Changes
891Writing Safe Migrations
892The Expand-Contract Pattern
893Zero-Downtime Schema Changes
894Data Migration Strategies
895Testing and Reversibility

Software Engineering

860What is Normalization?
861The Normal Forms (1NF, 2NF, 3NF)
862Boyce-Codd Normal Form (BCNF)
863Higher Normal Forms (4NF, 5NF)
864The Cost of Over-Normalization
865Strategic Denormalization
866Denormalization Patterns
867Maintaining Consistency in Denormalized Data
868Balancing Normalization and Performance
869What Indexes Are and How They Work
870The Cost of Indexes: Storage and Write Performance
871Identifying Columns to Index
872Primary Key and Unique Indexes
873Composite Indexes and Column Order
874Covering Indexes
875Index Selectivity and Cardinality
876Partial and Filtered Indexes
877Index Maintenance and Statistics
878Using Query Execution Plans to Validate Indexes
879Understanding Query Execution Plans
880Index Selection and Coverage
881Filtering and Predicate Pushdown
882Join Order and Join Algorithms
883Avoiding N+1 Query Problems
884Query Rewriting for Performance
885Statistics and Query Planning
886Pagination and Large Result Sets
887Query Performance Testing and Monitoring
888Why Schema Evolution Is Inevitable
889Forward-Only Migration Philosophy
890Versioning Schema Changes
891Writing Safe Migrations
892The Expand-Contract Pattern
893Zero-Downtime Schema Changes
894Data Migration Strategies
895Testing and Reversibility

← Software Engineering

Lesson 882 of 1,933·27. Database Design in PracticePro lesson

Join Order and Join Algorithms

Understand how join order affects performance and the trade-offs between nested loop, hash, and merge joins.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course