In the context of schema normalization in relational DBMS, consider a set F of functional dependencies. The set of all functional dependencies implied by F

Question

In the context of schema normalization in relational DBMS, consider a set F of functional dependencies. The set of all functional dependencies implied by F is called the closure of F. To compute the closure of F, Armstrong's Axioms can be applied. Consider X, Y, and Z as sets of attributes over a relational schema. The three rules of Armstrong's Axioms are described as follows.
Reflexivity: If Y subset of X, then X → Y
Augmentation: If X → Y, then XZ → YZ for any Z
Transitivity: If X → Y and Y → Z, then X → Z
The additional rule of Union is defined as follows.
Union: If X → Y and X → Z, then X → YZ
It can be proved that the additional rule of Union is also implied by the three rules of Armstrong's Axioms. Listed below are four combinations of these three rules. Which one of these combinations is both necessary and sufficient for the proof ?

Accepted Answer

D. Augmentation and Transitivity

Related Database Management PYQs

Turn practice into measurable progress