757 views
1 votes
1 votes

Q1) Consider the relation with n attributes if any 2 attribute is a candidate key, then the total number of candidate keys are___ ?

Then what will be the generalized formula 

I) $\sum_{i=2}^{n}C(n,i)$

II) $\sum_{i=2}^{n}C(n,i)*C(i,2)$

I think second one should be the formula for it.

Suppose we have R(ABCD) and any two attribute is a candidate key, then two different candidate keys with different extra attribute will not be calculated as single super key.

For example, we have the Super key ABE with different candidate keys(mentioned in bold letters) and with different extra attributes which are ABE, ABE, and AEB

Above is superkeys are according to the second formula but if we go according to the first formula then ABE is a single superkey.

So which one is correct?

Q2) Is the answer remains same if use every in place of any in above question?

Please log in or register to answer this question.

Related questions

9 votes
9 votes
4 answers
1
saket nandan asked Apr 7, 2016
15,763 views
a relation R(A,B,C,D,E,F,G,H)and set of functional dependencies are {CH->G,A->BC,B->CFH,E->A,F->EG }then how many possible super keys are present ?
4 votes
4 votes
1 answer
3
Akash Kanase asked Jan 15, 2016
707 views
I think here even with Ph is removed from table we still get 12 Super keys. Because Salary & One of CK must be there.
0 votes
0 votes
0 answers
4
supratikde707 asked Jan 9
133 views
r=(a1,a2,a3,...a8) assumne that a1a2a3 is a canidate key and other cks we dont know.Then find the number of possible candidate keys and number of superkeys?