1 votes 1 votes Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________. Databases made-easy-test-series databases candidate-key + – Shreya2002 asked Aug 9, 2022 Shreya2002 1.6k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Shreya2002 commented Aug 9, 2022 reply Follow Share Thanku sir…. 0 votes 0 votes Kabir5454 commented Aug 9, 2022 reply Follow Share @Shreya2002 don’t call me sir ..I am a aspirant.😁 0 votes 0 votes abhinowKatore commented Aug 24, 2022 reply Follow Share Thank you for the explanation ✅ 1 votes 1 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes 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 kathan Mistry answered Aug 9, 2022 • edited Aug 9, 2022 by kathan Mistry kathan Mistry comment Share Follow See all 0 reply Please log in or register to add a comment.