in Databases
189 views
0 votes
0 votes

Consider a relation schema r(ABCDEF) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.

in Databases
189 views

4 Comments

Thanku sir….
0
0

@Shreya2002 don’t call me sir ..I am a aspirant.😁

0
0
Thank you for the explanation βœ…
1
1

1 Answer

2 votes
2 votes
Best answer

Maximum number of candidate keys for a relation can be given by:$\binom{n}{\left \lceil n/2 \right \rceil}$. For example R(A,B,C,D) have AB,BC,CD,AD,BD .Here A is fixed in any candidate key, so for other 5 attributes we  have $\binom{5}{\left \lceil 5/2 \right \rceil} = 10$ keys. So, answer is 10.

Reference: sql - finding largest number of candidate keys that a relation has? - Stack Overflow

edited by

Related questions

0 votes
0 votes
1 answer
3