Question: Given a relation schema R = (A,B,C,D,E,F,G), and a set of functional dependencies FD = {A -> BCDEFG, CE -> A, BF -> EG }
Given a relation schema R = (A,B,C,D,E,F,G), and a set of functional dependencies FD = {A -> BCDEFG, CE -> A, BF -> EG } held on R.
- (3 points) {CE} a candidate key of relation R? Justify your answer.
- (3 points) Is R in BCNF? If not, decompose it into smaller relations such that these smaller relations are in BCNF?
- (2 points) Is the decomposition a lossless-join decomposition? Justify your answer.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
