Register

#candidate keys

2,558 views
1 votes
1 votes
Given a relation R{A, B, C, D, E, H} and having the following functional dependencies :

{A → BC, CD → E, E → C, D → AEH, ABH → BD, DH → BC}

The number of candidate keys for relation R is ________.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
3 answers
2
srestha asked Jul 15, 2018
600 views
Keys in a Decomposition
Relation $R=(L, M, N, O, P)$ $R$ is decomposed into $R_{1} = (L, M, N, P)$ and $R_{2} = (M, O).$ for $R_{1}$ dependencies are $P->L, L->MN$ $1)$What are keys for $R_{1}$? $2)$What normal form it holds?
Relation $R=(L, M, N, O, P)$$R$ is decomposed into $R_{1} = (L, M, N, P)$ and $R_{2} = (M, O).$for $R_{1}$ dependencies are $P->L, L->MN$$1)$What are keys for $R_{1}$?$2)...
User Avatar
2 votes
2 votes
1 answer
3
Na462 asked May 26, 2018
1,968 views
Candidate Keys
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. What i did is $^8C_4 + ^8C_5 + ^8C_6 + ^8C_7 + ^8C_8 = 163$ Is it wrong ? and why
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....
User Avatar
Link Copied!