Can you get the same bcnf decomposition


Consider the following set F of functional dependencies on the relation schema r (A, B, C, D, E, F)
Part (a)
Compute B+?
Part (b)
Prove that AF is a superkey
Part (c)
Compute a canonical cover for the above set of functional dependencies F; give each step of your derivation with an explanation
Part (d)
Give a 3NF decomposition of r based on the canonical cover.
Part (e)
Give a BCNF decomposition of r using the original set of functional dependencies
Part (f)
Can you get the same BCNF decomposition of r as above, using the canonical cover? 

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Can you get the same bcnf decomposition
Reference No:- TGS082513

Expected delivery within 24 Hours