Skip to Main Content
Learn T-SQL Querying
book

Learn T-SQL Querying

by Pedro Lopes, Pam Lahoud
May 2019
Intermediate to advanced content levelIntermediate to advanced
484 pages
11h 23m
English
Packt Publishing
Content preview from Learn T-SQL Querying

Hash Match joins

A Hash Match is a blocking operator that represents a Hash join operation in an execution plan. Hash joins are the most efficient way to join two large input that are not sorted and/or do not have any indexes that support the join. A Hash Match operation is expensive in that it consumes a significant amount of memory and CPU and may generate additional I/O if it does not fit in memory, but it is generally faster than both Nested Loops and Merge Joins when joining a large number of unsorted rows.

With a Hash Match, the Outer Table is also referred to as the Build Table and the Inner Table is referred to as the Probe Table. The smaller of the two input will be chosen as the Build Table, which will be used to build a hash table ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learn T-SQL Querying - Second Edition

Learn T-SQL Querying - Second Edition

Pedro Lopes, Pam Lahoud
SQL Server T-SQL Recipes, Fourth Edition

SQL Server T-SQL Recipes, Fourth Edition

Jason Brimhall, Jonathan Gennick, Wayne Sheffield

Publisher Resources

ISBN: 9781789348811Supplemental Content