Read bitmap filters in parallel hash join plans, compare fact scan output, and distinguish early row rejection from guaranteed savings.
OPTION (FORCE ORDER): When a Join Order Hint Helps and Hurts
Test OPTION (FORCE ORDER) against real join plans, see when fixed table order helps or hurts, and apply a reversible Query Store hint.
Narrow Index Keys: Why the Clustered Key Width Matters Everywhere
Evaluate narrow index keys by comparing clustered GUID and integer designs, measuring index pages, and preserving natural uniqueness.
SQL SERVER – Tips for SQL Query Optimization by Analyzing Query Plan
An overloaded ERP system taught me a lot. Here are my tips for SQL query optimization by analyzing the query plan of the most resource consuming queries.
An Index Seek That Reads Millions of Rows: Residual Predicates
Diagnose an index seek that reads far more rows than it returns by checking residual predicates, Actual Rows Read and index key order.
The Four Window Functions You Will Actually Use
Learn four practical window functions with SQL examples for numbering rows, ranking ties, comparing previous values, and calculating running totals.
Rewriting OR Conditions So the Index Gets Used
Rewrite OR conditions with separate seeks, preserve duplicate and NULL behavior, and compare plans before choosing UNION or recompilation.