ISI DBMS
Consider the relations r1(A, B, C), r2(C, D, E) and r3(E, F). Assume that the set of all attributes constitutes the primary keys of these relations, rather than the individual ones. Let V (C, r1) be 500, V (C, r2) be 1000, V (E, r2) be ... r2 has 1500 tuples, and r3 has 750 tuples, then give the ordering of the natural join r1 ▷◁ r2 ▷◁ r3 for its efficient computation. Justify your answer
Consider the relations r1(A, B, C), r2(C, D, E) and r3(E, F). Assume that the set of all attributes constitutes the primary keys of these relations, rather than the individual ones. Let V (C, r1) be 500, V (C, r2) be 1000, V (E, r2) be 50, ... , r2 has 1500 tuples, and r3 has 750 tuples, then give the ordering of the natural join r1 ▷◁ r2 ▷◁ r3 for its efficient computation. Justify your answer
asked
Apr 18, 2019
in Databases
Priyanka17
121 views