How did you know that you can only make up to two combinations of CK for a given question? why not 3 like ABC for example or 4 like ABCD or even five like ABCDE??
Thank you for very clear video. Just a question: why are we considering not only A and E but also BC and CD as candidate keys? By definition of candidate key, the set with minimum number of attributes are just A and E, both with 1 attribute, while BC and CD have both two attributes.
Bro the size of the key doesn't matter because the statement is- minimal set of super key not minimum so any size if its the minimal version and u can't remove anything from it then it can become the candidate key
Thank you for the help. Quick question, finding the candidate keys with 2 combinations of all attributes will always work regardless of how many Attributes and functional dependencies right? that is, there wont ever be a need to use 3 or more combinations of attributes correct?
I have given the reason at the end of the video. Watch full video. Here Candidate keys are -- A, E, BC, CD all the attributes are covered (A,B,C,D,E) If you try to find C.K with 3 combinations you'll get super key. To understand the concept of super key, watch my video on it. Link is in description box.
I have seen many videos in youtube but this is the best video which clears all my doubt thank u so much mam 🙏
I searched lots of video for this topic but this video is the best!!!!!!! Thanks a lot..
Thanku ❤️for ur valuable comment.
Kindly Share the channel or video link with computer science students only 😊
Thank you very much for the clear explanation! You have increased the possibility of me passing my final Database Exam! :)
All the best for your exam 👍.
Kindly Share the channel or video link with computer science students only 😊
nicely explained 😀😀
Excellent teaching the best method
Heartly thanks ma'am
u deserved a more sub
@@ChabPoha thanks 😊. Kindly share the channel or video link with computer science students only
How did you know that you can only make up to two combinations of CK for a given question? why not 3 like ABC for example or 4 like ABCD or even five like ABCDE??
Too much good explanation 👍👍👍👍👍👍👍👍👍👍👍👍
Thanku😍
Kindly share the channel link with computer science students only
Thank so much mam ❤️🙏
Super mam
Thank you for very clear video. Just a question: why are we considering not only A and E but also BC and CD as candidate keys? By definition of candidate key, the set with minimum number of attributes are just A and E, both with 1 attribute, while BC and CD have both two attributes.
Bro the size of the key doesn't matter because the statement is- minimal set of super key not minimum so any size if its the minimal version and u can't remove anything from it then it can become the candidate key
thank u mam super explainantion keep doing videoes☺
U Keep watching my other videos as well and share the channel or video link with computer science students only 😊
Thank you for the help. Quick question, finding the candidate keys with 2 combinations of all attributes will always work regardless of how many Attributes and functional dependencies right? that is, there wont ever be a need to use 3 or more combinations of attributes correct?
Yes mostly but you can't say never.
Thanks ma'am 🙏❤
thanks alot 💕💕
mam how to find key attributes? it is asked in my uiniversity exam
why we have not found candidate key with 3 combinations?
I have given the reason at the end of the video. Watch full video.
Here Candidate keys are --
A, E, BC, CD
all the attributes are covered (A,B,C,D,E)
If you try to find C.K with 3 combinations you'll get super key.
To understand the concept of super key, watch my video on it.
Link is in description box.
i got it ma'am thanks a lot.
Kindly share the channel/ video link with computer science students 😊
thank you so much
Keep watching 😊
thnks
Mam how to find primary key using clouser method
Closure method is to find candidate keys not the primary key.
thx
Using the same example
Thank you so much