0

Consider the following set of functional dependencies on the relation schema R = (A, B, C, D, E). Decompose the relation into a collection of relation schemas in 4NF. Provide detailed information of the decomposition process.

AB →→ C
B → D
A → E

If you start from the top with AB →→ C, doesn't that fit 4nf and you are done?

Elzo Valugi
  • 27,240
  • 15
  • 95
  • 114
Nick
  • 47
  • 5
  • That sounds like a homework question. – Kristina May 08 '16 at 21:36
  • 1
    you may also want to post this on : https://dba.stackexchange.com/ – Elzo Valugi May 08 '16 at 21:37
  • It is a review question for a final, I know bcnf, but when multi-value dependencies are added I am not too sure. When you get your candidate keys {A,B} you see that AB is a super key and that AB →→ C is 4nf and there is nothing to do for the question. – Nick May 08 '16 at 21:46
  • 1
    @Nick you seem to be confusing a multivalued dependency for a schema. – reaanb May 10 '16 at 15:49
  • "AB →→ C" means {A,B} multidetermines {C}. Please show your work in finding the CK(s). Please be more explict about all your reasoning. – philipxy May 11 '16 at 22:21

0 Answers0