recategorized by
2,410 views
5 votes
5 votes
A relation R(A,B,C,D,E,F) holds following FDs
$AB\rightarrow C$
$C\rightarrow D$
$D\rightarrow EA$
$E\rightarrow F$
$F\rightarrow B$

The number of minimal candidate keys of R are _______.
recategorized by

3 Answers

Best answer
8 votes
8 votes

Only 2 candidate keys which are minimal means length of 1 which are C and D.

D+ ->EAFBCD               [minimal since length is 1 ]

C+ -> D+ -> EAFBCD     [minimal since length is 1 ]

(AB)+-> C+ -> D+ -> EAFBCD   [not minimal since length is 2]

(AF)-> (AFB)+-> C+ -> D+ -> EAFBCD [ not minimal since length is 2 ]

(AE)-> (AF)+-> C+ -> D+ -> EAFBCD [ not minimal since length is 2 ]

selected by
2 votes
2 votes

As per the given FDs

AB→C
C→D
D→EA
E→F
F→B

We find that, every attributes are present in RHS of the FD. So we'll first go through length one of candidate key.

A=A

B=B

C+= (C, D, E, A, F, B)  // C is a minimal Candidate Key.

D+= (C, D, E, A, F, B)  // D is a minimal Candidate Key.

E+= (E, F, B)

F+=(F, B)

Here we cannot got for candidate key of length two, as the question is asking about "minimal" Candidate key.

Hence the number of minimal Candidate key is 2.

0 votes
0 votes
here C can identify the attributes , D, AB also , and You cannot identify only with E  and F as E and F cannot derive AB or C or D...but they can derive B so if we have AE, AB they can derive all the attributes now ypu cannot add C,D to E,F as C,D are already candidate keys , if u add they are made into super keys.... so number of candidate keys are 5...

but they asked minimal candidate keys so 2 which are C,D

Related questions

0 votes
0 votes
3 answers
1
4 votes
4 votes
4 answers
2
Anirudh Pandey asked Sep 19, 2017
1,414 views
If A Relation R(A,B,C,D) and CK given is (AB,C)and FD is given as A->C Then the relation is in which highest normal form?
2 votes
2 votes
2 answers
3
Parshu gate asked Sep 17, 2017
1,135 views