edited by
5,292 views

3 Answers

Best answer
3 votes
3 votes

Given Relation is R = ABCDEFG

Take options

  1. A = A
  2. AB = ABC
  3. ABC = ABC
  4. ABD = ABDEFCG (ABCDEFG)

Hence answer would be 4) ABD will be the candidate keys. 

selected by
1 votes
1 votes
ABD={A,B,C,D,E,F,G} Simply take  closure of ABD .
0 votes
0 votes
Find the closure of each options given

answer is ABD

ABD+  = initially add {A,B,D}

since AD -> E we can add E

then since BE -> F we can add F also

so ABD+ = {A,B,C,D,E,F}

since the closure contain all the attributes in the relation. it is a candidate key

for other options the attribute closure will not contain all the attributes
Answer:

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Aug 8, 2016
2,311 views
A data which improves the performance and accessibility of the database are called:IndexesUser DataApplication MetadataData Dictionary
1 votes
1 votes
1 answer
4
Sankaranarayanan P.N asked Aug 2, 2016
2,081 views
Match the following database terms to their functions $:$$\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{(a)} & \text{Normalization} & \te...