44.4k views
3 votes
Given R as R = {A, B, C, D, E, F, G, H, I, J} , 10 points

And the following different set of functional dependencies
G = {{A, B}→{C}, {B, D}→{E, F}, {A, D}→{G, H}, {A}→{I}, {H}→{J} }
Determine the candidate keys and all prime and non-prime attributes. Is it in 2NF

User Asachet
by
6.8k points

1 Answer

5 votes

Final answer:

The candidate keys are {A, B}. All attributes are prime attributes. The relation is in 2NF.

Step-by-step explanation:

The candidate keys are determined by identifying the minimal set of attributes that can uniquely determine all other attributes in the relation. In this case, we can start by examining the functional dependencies. We can see that {A, B} is a candidate key because {A, B}→{C}, {B, D}→{E, F}, and {A, D}→{G, H}. All the attributes A, B, C, D, E, F, G, H, I, J are prime attributes. Non-prime attributes would be the attributes that are not part of a candidate key, which in this case is none. To check if the relation is in 2NF, we need to make sure that for each non-trivial functional dependency X → Y, X should be a superkey. In this case, all the functional dependencies satisfy this condition, so the relation is in 2NF.

User LievenV
by
7.8k points