Hash join: Difference between revisions
Content deleted Content added
Created page with "{{task}}Hash Join The classic hash join algorithm for an inner join of two relations has the following steps: <ul> <li>. Hash phase : Creating a hash table f..." |
mNo edit summary |
||
| Line 2: | Line 2: | ||
The classic hash join algorithm for an inner join of two relations has the following steps: |
The classic hash join algorithm for an inner join of two relations has the following steps: |
||
<ul> |
<ul> |
||
<li> |
<li>Hash phase : Creating 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 |
function to the join attribute of each row. Ideally we should create a hash table for the |
||
smaller relation. Thus, optimizing for creation time and memory size of the hash table.</li> |
smaller relation. Thus, optimizing for creation time and memory size of the hash table.</li> |
||