SQL Server 执行连接的方式 - Nested Loops Joins

The nested loops join, also called nested iteration, uses one join input as the outer input table (shown as the top input in the graphical execution plan) and one as the inner (bottom) input table. The outer loop consumes the outer input table row by row. The inner loop, executed for each outer row, searches for matching rows in the inner input table.

In the simplest case, the search scans an entire table or index; this is called anaive nested loops join. If the search exploits an index, it is called anindex nested loops join. If the index is built as part of the query plan (and destroyed upon completion of the query), it is called atemporary index nested loops join. All these variants are considered by the query optimizer.

A nested loops join is particularly effective if the outer input is small and the inner input is preindexed and large. In many small transactions, such as those affecting only a small set of rows, index nested loops joins are superior to both merge joins and hash joins. In large queries, however, nested loops joins are often not the optimal choice.

 

 

http://technet.microsoft.com/en-us/library/ms191318(v=sql.105).aspx