Articles

Page 9 of 11 — showing articles 145 to 162 of 182

SQL Server, Seeks, and Binary Search

Game of Chance

SQL Server b-tree seeks can use binary search or linear interpolation (with linear regression). The latter can be more efficient, except when key values are separated by a small fixed gap.

Bitmap Magic

Bitmap Magician

The SQL Server bitmap operator enables early semi join reduction for hash and merge joins.

Why Internals Knowledge Matters

Perfectly Tuned

Query tuning considerations that are often overlooked. How deep internals knowledge can help you write better T-SQL.

Seeking Without Indexes

Elementary

Singleton seeks, range scan seeks, multiple seeks in one, and a seek on a heap with no indexes

Is it a Seek or a Scan?

Seek or Scan?

Singleton seeks and seeks with range scans. Multiple seeking operations in a single SQL Server execution plan operator.

When is a Seek not a Seek?

It's a Puzzle

SQL Server can perform multiple index seeking operations in a single Index Seek operator.

Heaps of Trouble?

Hash Join

How a nested loops join with Eager Index Spools can be faster than a hash join.