Discussion
Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t. functional dependencies :
| List - I | List - II |
|---|---|
| a. Decomposition rule | i. If \(X \to Y\) and \(Z \to W\) then \(\{X, Z\} \to \{Y, W\}\) |
| b. Union rule | ii. If \(X \to Y\) and \(\{Y, W\} \to Z\) then \(\{X, W\} \to Z\) |
| c. Composition rule | iii. If \(X \to Y\) and \(X \to Z\) then \(X \to \{Y, Z\}\) |
| d. Pseudo transitivity rule | iv. If \(X \to \{Y, Z\}\) then \(X \to Y\) and \(X \to Z\) |
Codes : a b c d
Answer: D
The match is a-iv, b-iii, c-i, d-ii. The decomposition rule says that if X determines {Y, Z} then X determines Y and X determines Z (iv). The union rule says that if X determines Y and X determines Z then X determines {Y, Z} (iii). The composition rule joins two dependencies, X to Y and Z to W giving {X, Z} to {Y, W} (i). Pseudo transitivity says that if X determines Y and {Y, W} determines Z then {X, W} determines Z (ii).
The other codes confuse union with decomposition, since they run in opposite directions.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development