If
- relation r has br blocks and nr records,
- relation s has bs blocks and ns records,
- memory can hold exactly one block of r and one block of s at any point in time,
then
what is the formula for number block accesses required to perform join (if relation r is the part of outer loop) using
(a) nested loop join
(b) blocked nested loop join
Also which book discusses this topic? And is it in syllabus for gate?