Consider two relations A and B. A has 80,000 tuples and B has 100,000 tuples, and both relations sto ...

---

Consider two relations A and B. A has 80,000 tuples and B has 100,000 tuples, and both relations store 100 tuples per page. Consider the SQL statement SELECT * FROM A INNER JOIN B ON A.a = B.a, an equijoin with the condition A.a = B.a. There are 102 buffer pages available for this operation. Both relations are stored as unsorted heap files, and neither has any index. Calculate the cost of each of the following join strategies, measured in the number of disk I/Os (pages). (a) Page-oriented nested loops join, with A as the outer relation. (b) Block-oriented nested loops join, with A as the outer relation. (c) Sort-merge join, assuming it can be done in 2 passes. (d) Hash join.