May 8, 2014 at 3:32 pm
Which is faster : Nested, Merge ou Hash Joins ?
Thanks.
Alexandre Araujo
May 8, 2014 at 3:50 pm
Yes.
Seriously though, each one is more efficient in a given situation. If both data sets are ordered, the Merge join is extremely efficient. If you have a smaller set of data in the inner loop, a nested loops join is extremely efficient. If your data is unordered and large, a hash join can work really well. It's completely situational which one works better in a given situation. That's why the optimizer has the choice. No one join will satisfy all situations.
"The credit belongs to the man who is actually in the arena, whose face is marred by dust and sweat and blood"
- Theodore Roosevelt
Author of:
SQL Server Execution Plans
SQL Server Query Performance Tuning
Viewing 2 posts - 1 through 1 (of 1 total)
You must be logged in to reply to this topic. Login to reply