Consider three relations R1(X, Y, Z), R2(M, N, P ), and R3(N, X). The
primary keys of the relations are in Bold. The relations have 100, 30, and
400 tuples, respectively. The space requirements for different attributes are:
X = 30 bytes, Y = 10 bytes, Z = 10 bytes, M = 20 bytes, N = 20 bytes,
and P = 10 bytes. Let V (A, R) signify the variety of values that attribute
A may have in the relation R. Let V (N, R2) = 15 and V (N, R3) = 300.
Assume that the distribution of values is uniform.
If R1, R2, and R3 are to be joined, find the order of join for the minimum cost. The cost of a join is defined as the total space required by
the intermediate relations. Justify your answer.
