edited by
212 views
1 votes
1 votes

The FD $A \rightarrow B, \ \  DB \rightarrow C$ implies

  1. $DA \rightarrow C$
  2. $A \rightarrow C$
  3. $B \rightarrow A$
  4. $DB \rightarrow A$
edited by

1 Answer

Best answer
1 votes
1 votes
$A \rightarrow B$ i.e. B can be determined by A.

$DB \rightarrow C$ i.e. C can be determined by (D, B)

From this we can infer that (D, A) can determine C, i.e. $DA \rightarrow C$.

Proof using Armstrong's Axioms:-

$A \rightarrow B$

$DA \rightarrow DB$ (augmentation)

$DA \rightarrow C$ (transitivity)
selected by
Answer:

Related questions

1 votes
1 votes
1 answer
1
Bikram asked Nov 26, 2016
333 views
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________....
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
243 views
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
314 views
What does the following Tuple Relational Calculus query produce?The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ...