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$. Armstrong's axioms are Reflexivity, Augmentation, and Transitivity. The derived Union rule is: if $X \to Y$ and $X \to Z$, then $X \to YZ$. Which one of the following combinations of Armstrong's axioms is both necessary and sufficient to prove the Union rule?
To derive Union from $X\to Y$ and $X\to Z$, first apply Augmentation to $X\to Y$ using $X$ to get $X\to XY$. Next apply Augmentation to $X\to Z$ using $Y$ to get $XY\to YZ$. Then apply Transitivity to conclude $X\to YZ$. Reflexivity is not needed. Therefore, Augmentation and Transitivity are sufficient, and they are the required combination. Hence option (D) is correct.
More Integrity Constraints and Normal Forms questions
GATE 2025 CS (CS2) Q46– Consider the following relational schema along with all the functional dependencies that…
GATE 2024 CS (CS1) Q22– Which of the following statements about a relation R in first normal form (1NF) is/are…
GATE 2024 CS (CS1) Q44– The symbol → indicates functional dependency in the context of a relational database.…
GATE 2024 CS (CS2) Q56– A functional dependency F: X Y is termed as a useful functional dependency if and only if…
GATE 2022 CS Q14– In a relational data model, which one of the following statements is TRUE?
GATE 2022 CS Q31– Consider a relation R(A,B,C,D,E) with the following three functional dependencies. AB C;…