Question: Question 2. Consider the relation scheme R2 = {A, B, C, D, E, G} and the set of functional dependencies for the relation R2 are

Question 2. Consider the relation scheme R2 = {A, B, C, D, E, G} and the set of functional dependencies for the relation R2 are F2 = {AB C, AC B, ABD E, D B, BC A, E G}. a) Find all candidate keys of F2. b) Derive a canonical cover for F2 in a systematic manner. c) Find a 3NF decomposition for R2 that is lossless and dependency preserving. d) is R2 in BCNF? if it is not in BCNF, find a BCNF Decomposition that is lossless. Is your BCNF decomposition in (c) dependency-preserving? e) If R2 is decomposed into {ABC, ACDE, ADG}, will the decomposition lead to a lossless-join? Is the dependency preserved (if-any)?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!