Hash join: Difference between revisions

clean up verbiage a bit
(clean up verbiage a bit)
Line 2:
The classic [[wp:Hash Join|hash join]] algorithm for an inner join of two relations has the following steps:
<ul>
<li>Hash phase : CreatingCreate a hash table for one of the two relations by applying a hash
function to the join attribute of each row. Ideally we should create a hash table for the
smaller relation. Thus, thus optimizing for creation time and memory size of the hash table.</li>
<li>Join phase : ScanningScan the larger relation and findingfind the relevant rows by looking in the
hash table created before.</li>
</ul>
Line 21:
'''place''' relation in ''Q''
 
ImplementTask: implement the Hash Join algorithm inand yourshow programming languagethe (optionallyresult providingof ajoining testtwo casetables aswith well)it.
 
=={{header|Haskell}}==
Anonymous user