Given two tables R and S, which of the following join strategies is described by the following algorithm:

a. Hash join.

b. Sort-merge join.

c. Nested-loop join.

d. None of the above.

Transcribed Image Text:

Denote S outer table For every rows in S do for every row r in R do {if r(a) = s(b) then join r with s and place in output buffer} }