We cannot guarantee that BCNF relation schema will be produced by dependency preserving decomposition of non-BCNF relation schema. Give the counter example to illustrate this point

0

We cannot guarantee that BCNF relation schema will be produced by dependency preserving decomposition of non-BCNF relation schema. Give the counter example to illustrate this point

0

Ayana

Asked: October 30, 2021In: DBMS

Consider the universal relation R= {A,B,C,D,E,F,G,H,I,J} and a set of functional dependencies F= { {AB→ C}, { A → DE}, { B→ F}, {F→ GH}, {D→ IJ}}. What is the key for R? Decompose R into 2NF, then 3NF relations.

0

Consider the universal relation R= {A,B,C,D,E,F,G,H,I,J} and a set of functional dependencies F= { {AB→ C}, { A → DE}, { B→ F}, {F→ GH}, {D→ IJ}}. What is the key for R? Decompose R into 2NF, then 3NF relations.