2,467 views
0 votes
0 votes
Given relation R(A, B, C, D, E) and set of functional dependencies   

F = {AB → C, AB → D, D → A, BC → D, BC → E}

Number of candidate key in the following relation have?

1 Answer

Best answer
6 votes
6 votes
$B$ cannot be derived using any functional dependency. So, it will necessarily present in candidate key.

$(AB)^+ = \big \{A,B,C,D,E\big \}$

$(BC)^+ = \big \{ B,C,D,E,A \big \}$

$(BD)^+ = \big \{ B,D,A,C,E \big \}$

$(BE)^+ = \big \{B,E \big\}$

So, above relation has $3$ candidate keys $\color{maroon}{\big \{AB,BC,BD \big \}}$

Also the given relation in "3NF"
edited by

Related questions

4 votes
4 votes
4 answers
1
Anirudh Pandey asked Sep 19, 2017
1,412 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
2
Parshu gate asked Sep 17, 2017
1,133 views
1 votes
1 votes
1 answer
3
hacker16 asked Jan 17, 2018
2,700 views
R (A1, A2, ….An) and every (n-2) attributes of R forms a candidate key. How many superkeys are there in R?a) $_{n-2}^{n}\textrm{C}$b) $_{n-2}^{n}\textrm{C}$ * 4c) $_{n-...
5 votes
5 votes
3 answers
4
GateAspirant999 asked Oct 29, 2016
2,408 views
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 a...