-
The following functional dependencies hold for relations R(A, B, C) and S(B, D, E)
B → A,
A → C
The relation R contains 200 tuples and the relation S contain 100 tuples. What is the maximum number of tuples possible in the natural join R ⋈ S?
-
- 100
- 200
- 300
- 2000
- 100
Correct Option: A
B → A where R(A, B, C) and S(B, D, E), A → C
R contains 200 tuples and S contains 100 tuples.
Natural join ⋈ = R ⋈ S = π[σ(R × S)]
So, R = 200 tuples and S = 100 tuples
So, R ⋈ S = 100 [common is both or we can say distinct equality between all common attributes]
B → A where R(A, B, C) and S(B, D, E), A → C
R contains 200 tuples and S contains 100 tuples.
Natural join ⋈ = R ⋈ S = π[σ(R × S)]
So, R = 200 tuples and S = 100 tuples
So, R ⋈ S = 100 [common is both or we can say distinct equality between all common attributes]
