Jump to content

Hash join: Difference between revisions

m
no edit summary
(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:
The classic hash join algorithm for an inner join of two relations has the following steps:
<ul>
<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
smaller relation. Thus, optimizing for creation time and memory size of the hash table.</li>
Cookies help us deliver our services. By using our services, you agree to our use of cookies.