Question

You: 20
00:48
Consider a join (relation algebra) between relations r(R)and S(S) using thenested loop method. There are 3 buffers each of size equal to
disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer
number of disk block accesses if
relation r(R) is in the outer loop
relation s(S) is in the outer loop
join selection factor between r(R) and S(S) is more than 0.5
join selection factor between r(R) and s(S) is less than 0.5
Nexliv
Leave Game​

Answer 1

Answer:

I don't know

Explanation:

) between relations r(R)and S(S) using thenested loop method. There are 3 buffers each of size equal to

disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer

number of disk block accesses if

relation r(R) is in the outer loop

relation s(S) is in the outer loop

join selection factor between r(R) and S(S) is more than 0.5

join selection factor between r(R) and s(S) is less than 0.5

Nexliv

Leave Game