707 views
2 votes
2 votes
given R(ABCDE)

AB -> C

C -> D

B ->E

FIND CANDIDATE KEY

 

Solution :  AB will be candidate key   because (AB)+   = R

my question is do i have to check for  (AC)+ ,(AD)+ , (AE)+ , (ACDE)+

1 Answer

Best answer
0 votes
0 votes
From the RHS of the every FD given for the relation, it can be observed that we can find C,D and E attribute values using the FD. But Remaining attributes AB will not derived using any of the FD, hence these should be part of the CK. An attribute set which does not contain AB will not be candidate key, hence no need to check for (AC)+ and others you have mentioned.

For any attribute or attribute set , if we can able to get all the attributes by applying closure set of attributes, then that attribute or attribute set will become CK.
selected by

Related questions

1 votes
1 votes
0 answers
3
anupamsworld asked Jul 29, 2022
527 views
Find the candidate key(s) of the relation R(UVWXYZ) with FD set F={UV >W, XW >Y, U >XZ, Y >U}XWUV, YV, WXVYUV, XV, WVNone of these
2 votes
2 votes
1 answer
4
Na462 asked May 26, 2018
1,926 views
Consider the following relation $R(A, B, C, D, E, F, G, H)$. The maximum number of super keys possible if $4$ simple candidate keys in relation $R$ are ________.Solution....