614 views
0 votes
0 votes
A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R can be.?

1 Answer

2 votes
2 votes

By this statement ,"It is known that D never appears on RHS of any FD" , we are assured that D has to be in candidate key. Remaining may or may not be the part of the candiadte key ie. two choices for remaining attributes.

So, 26 = 64 will be total possibilities for CK.

Related questions

1 votes
1 votes
0 answers
1
anupamsworld asked Jul 29, 2022
555 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
33 votes
33 votes
4 answers
3
Kathleen asked Oct 5, 2014
8,964 views
An instance of a relational scheme $R(A, B, C)$ has distinct values for attribute $A$. Can you conclude that $A$ is a candidate key for $R?$
53 votes
53 votes
4 answers
4