Consider a relation R(A,B,C,D) with functional dependencies: $A \rightarrow B$, $BC \rightarrow D$, $D \rightarrow A$. (i) List all minimal candidate keys of R. (ii) State the highest normal form R satisfies. (iii) Decompose R into BCNF and give the resulting relation schemas.

Question

Accepted Answer

Candidate keys: {BC, CD}; Highest normal form: 1NF; BCNF decomposition: R1(A,B), R2(A,D), R3(C,D)

Neco 2023 Computer Studies Question 31

Consider a relation R(A,B,C,D) with functional dependencies: \(A \rightarrow B\), \(BC \rightarrow D\), \(D \rightarrow A\). (i) List all minimal candidate keys of R. (ii) State the highest normal form R satisfies. (iii) Decompose R into BCNF and give the resulting relation schemas.

Answer Options

About This Question

Master the Exam!