434 views
0 votes
0 votes
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, and V (E, r3) be 150, where V (X, r) denotes the number of distinct values that appear in relation r for attribute X . If r1 has 1000 tuples, 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

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
admin asked Aug 8, 2022
269 views
In relational algebra, for any pair of relations $R_{1}$ and $R_{2}$, the standard division operation is denoted by $\div$ and defined as follows: $$ R_{1} \div R_{2}=\pi...
0 votes
0 votes
1 answer
3
MiNiPanda asked May 9, 2018
601 views
Let R(A,B,C) be a relation with primary key (A) and S(A,D,E) a relation with primary key (A,D). Each of the relations has n tuples. If the number of tuples in R natural j...
0 votes
0 votes
1 answer
4
Aakanchha asked May 3, 2018
675 views
Let R(A, B, C) be a relation with primary key (A) and S(A, D, E) a relation with primary key (A, D). Each of the relations has n tuples. If the number of tuples in R natu...