Consider the relations r 1 (A, B, C), r 2 (C, D, E), and r 3 (E, F), with primary keys A, C, and E, respectively Assume that r 1 has 1000 tuples, r 2 has 1500 tuples, and r 3 has 750 tuples Estimate the size of r 1 r 2 r 3 , and give an efficient strategy for computing the join ...

Assume we have a data structure which holds the unique values a ...

Consider the relations r 1 (A, B, C), r 2 (C, D, E), and r 3 (E,

Question:

Consider the relations r₁(A, B, C), r₂(C, D, E), and r₃(E, F), with primary keys A, C, and E, respectively. Assume that r₁ has 1000 tuples, r₂ has 1500 tuples, and r₃ has 750 tuples. Estimate the size of r₁ ⋈ r₂ ⋈ r₃, and give an efficient strategy for computing the join.