Talk:Hash join

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing  
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.

Isn't it the other way around? I believe I've read in a book that hash join goes like that:

...first, a single pass through the file with FEWER records... (partitioning phase) ...second, a single pass through the "other" file... (probing phase)Bold text

Yeah, you are right. I'll make some changes to this when I get some free time (hopefully later tonight). bDerrly 13:03, 10 March 2006 (UTC)
Fixed this problem (hjzla, March 18). Also added some more info.

The link at the bottom to the PDF file seems to be broken Mbadaire (talk) 22:54, 19 April 2010 (UTC)

I read this and I don't understand what a hash join is. It needs to be written more clear. ie. I was expecting to see a table structure, SQL, and an explanation why a statement is a hash join:

SELECT * FROM Contract c JOIN ContractType ct ON c.ContractTypeID = ct.ContractTypeID —Preceding unsigned comment added by (talk) 16:10, 14 April 2011 (UTC)

So fix it. Abolen (talk) 19:32, 14 April 2011 (UTC)

The "Classic hash join" section states "This algorithm is simple, but it requires that the smaller join relation fits into memory, ..." Shouldn't it be something like "This algorithm is simple, but it can loose its performance benefit if the hash table doesn't fit into memory..."? Randallbsmith (talk) 21:14, 11 August 2011 (UTC)