Suppose that relations r and s contain 20 and 30 blocks respectively, and the block nested-loop join algorithm is used to natural-join r and s. What is the cost in terms of number of seeks and number of block transfers in a best case senarious?
How many blocks of memory are required to achieve this cost in the best case senarous?