Computer Sciences > GATE 2026 SET-2 > Database Management System
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 𝑋,𝑌, and 𝑍 as sets of attributes over a relational schema. The three rules of Armstrong’s Axioms are described as follows.
Reflexivity: If 𝑌⊆𝑋 , then 𝑋→𝑌
Augmentation: If 𝑋→𝑌, then 𝑋𝑍→𝑌𝑍 for any Z
Transitivity: If 𝑋→𝑌 and 𝑌→𝑍, then 𝑋→𝑍
The additional rule of Union is defined as follows.
Union: If 𝑋→𝑌 and 𝑋→𝑍, then 𝑋→𝑌𝑍
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 ?
A
Reflexivity, Augmentation, and Transitivity
B
Reflexivity and Augmentation
C
Transitivity
D
Augmentation and Transitivity

Correct : d

The Union rule states: if X→Y and X→Z, then X→YZ. To prove this using Armstrong''s Axioms, we need to find the minimal combination of rules that makes this proof possible.
The proof works as follows. Start with X→Z. Apply Augmentation by adding X to both sides — since augmenting X→Z with X gives XX→XZ, and XX simplifies to X, we get X→XZ. Next, take X→Y and apply Augmentation by adding Z to both sides, giving XZ→YZ. Now we have X→XZ and XZ→YZ. Applying Transitivity to these two gives X→YZ, which is exactly the Union rule. The proof is complete using only Augmentation and Transitivity.
Reflexivity is never used in any step of this proof, so option A is incorrect — it includes an unnecessary rule and fails the "necessary" condition. Option B has Reflexivity and Augmentation but without Transitivity there is no way to chain X→XZ and XZ→YZ into X→YZ. Option C has only Transitivity but without Augmentation neither X→XZ nor XZ→YZ can be derived from the given dependencies.
Correct answer: D — Augmentation and Transitivity ✓

Similar Questions

In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps of transaction...
#176 MCQ
In the context of DBMS, consider the two sets T and S given below. Which one of the following is the correct match from T to S?
#1560 MCQ
Consider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A. For these two transactions to not conflict on A, wh...
#1565 MCQ

Related Topics

Armstrong axioms union rule GATE 2026 GATE CS 2026 Set-2 Q42 prove union rule Armstrong axioms augmentation transitivity union proof GATE functional dependency closure DBMS GATE schema normalization Armstrong axioms GATE

Unique Visitor Count

Total Unique Visitors

Loading......