COMP9315 Final Exam |
The University of New South Wales COMP9315 DBMS Implementation Final Exam |
DBMS Implementation |
Consider two tables R(x,y,z) and S(a,x,b)
with
Block nested loop join, with R as outer table and S as inner.
Sort merge join, using intermediate files for sorting.
Do not assume any sort order on the original files.
Grace hash join, with R as outer table and S as inner.
Use buffers as appropriate for input, output and in-memory hash tables.
You can assume that all hash functions distribute tuples uniformly
and that all partitions of R will fit in the in-memory hash table.
Show all working.
Instructions: