Q1. The sort-merge join which joins two relations R and S using the sort-merge join algorithm. Consider R represented by a heapfile H1, and S as H2 , respectively. You output each matching pair of...

Q1. The sort-merge join which joins two relations R and S using the sort-merge join algorithm. Consider R represented by a heapfileH1, and SasH2, respectively. You output each matching pair of records into the heapfileH3.

Q2. Use index-nested-loop algorithm to join two relations R and S. Consider R represented by a heapfileH1, and SasH2, respectively. You output each matching pair of records into the heapfileH3.

Q3. Compare the performance of these two join algorithms for different number of records in R and S.