Question: Problem 3. (30pts] Consider the relation R=(A, B, C, D, E, F, G, H). Assume that the following set of FDs holds: F={AB CEFGH, A
![Problem 3. (30pts] Consider the relation R=(A, B, C, D, E,](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f39dd255877_68166f39dd1cf17a.jpg)
Problem 3. (30pts] Consider the relation R=(A, B, C, D, E, F, G, H). Assume that the following set of FDs holds: F={AB CEFGH, A + D, FG, BF + H, BCH ADEFG, BCF + ADE). Find all the candidate keys of the relation R. Decompose the relation in the following normal forms (if it is not there already): a) 3NF, b) BCNF. For each decomposition that you make, state if it is (i) lossless join and (ii) dependency preserving
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
