Question: The hash join algorithm as described in Section computes the natural join of two relations. Describe how to extend the hash join algorithm to compute
The hash join algorithm as described in Section computes the natural join of two relations. Describe how to extend the hash join algorithm to compute the natural left outer join, the natural right outer join and the natural full outer join. Try out your algorithm on the customer and depositorrelations.

customer-name customer-street customer-city Spring Senator Adams Pittsfield Brooklyn Harrison Brooks Hayes Johnson Jones Lindsay Curry Smith Main Alma Palo Alto Main Harrison Park Pittsfield North Rye Rye Stamford North Turner Putnam Glenn Sand Hill Woodside Stamford Green Walnut Williams Nassau Princeton
Step by Step Solution
3.38 Rating (167 Votes )
There are 3 Steps involved in it
For the probe relation tuple t under consideration if no matching tuple is found in the build relati... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
16-CS-DB (298).docx
120 KBs Word File
