Which of the following options is/are always true?
We analyze each option based on the properties of functional dependencies (FDs) in relational databases. Let the relation schema have attributes $P, Q, R, S$. $X \rightarrow Y$ denotes a functional dependency, where $X, Y \subseteq \{P, Q, R, S\}$.
This statement is false. We can demonstrate this with a counterexample.
Consider a relation instance with the following tuples:
Let's check the conditions:
Now, let's check the conclusion:
Since the premise holds but the conclusion does not, this option is not always true.
This statement is false. A counterexample requires $\{P, Q\} \rightarrow \{R\}$ to be true, while *both* $\{P\} \rightarrow \{R\}$ and $\{Q\} \rightarrow \{R\}$ are false.
Consider the following relation instance:
Let's check the conditions:
Since $\{P\} \rightarrow \{R\}$ is false and $\{Q\} \rightarrow \{R\}$ is false, the conclusion $(\{P\} \rightarrow \{R\} \text{ or } \{Q\} \rightarrow \{R\})$ is false. The premise is true, but the conclusion is false, so this option is not always true.
This statement is true. This is a standard property derived from Armstrong's axioms, often proven using the augmentation and union rules.
Derivation:
Therefore, this option is always true.
This statement is true. This property follows directly from the definition of functional dependency and can be proven using Armstrong's axioms.
Proof by contradiction:
This demonstrates the Augmentation property where adding attributes to the determinant does not invalidate a dependency if the original determinant alone determines the dependent attributes.
Therefore, this option is always true.
Based on the analysis, options 3 and 4 are the statements that are always true regarding functional dependencies.
Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values.
F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R.
The relation R is
| A | B | C | D |
|---|---|---|---|
| $a_1$ | $b_1$ | $c_1$ | $d_1$ |
| $a_2$ | $b_3$ | $c_3$ | $d_1$ |
| $a_1$ | $b_2$ | $c_1$ | $d_2$ |
Let R = ABCDE is a relational scheme with functional dependency set F = {A → B, B → C, AC → D}. The attribute closures of A and E are
A relation R = {A, B, C, D, E, F,G} is given with following set of functional dependencies :
F = {AD → E, BE → F, B → C, AF → G}
Which of the following is a candidate key ?