Part-1 Finding Candidate Keys ; Closure set of Attributes in DBMS

Подписаться 2,5 тыс.

Просмотров 25 тыс.

50% 1

Super Key & Candidate Key
• Super Key & Candidate ...
Part 2-Finding candidate keys,closure set of attributes
• Part-2 Finding Candida...
complete playlist of cryptography & network security • Cryptography & Network...
complete playlist on computer networks
• COMPUTER NETWORKS
complete playlist on SQL
• SQL
complete playlist of DBMS
• DBMS

Опубликовано:

12 фев 2021

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 26

@matthevandenberg 16 дней назад

Thank you very much for the clear explanation! You have increased the possibility of me passing my final Database Exam! :)

@studytable75 16 дней назад

All the best for your exam 👍. Kindly Share the channel or video link with computer science students only 😊

@berilyavuz996 2 месяца назад

I searched lots of video for this topic but this video is the best!!!!!!! Thanks a lot..

@studytable75 2 месяца назад

Thanku ❤️for ur valuable comment. Kindly Share the channel or video link with computer science students only 😊

@shubhammore176 7 месяцев назад

Thank you so much

@pruthvirajkhot9537 7 месяцев назад

Thanks ma'am 🙏❤

@user-uc5ld2qr9z Месяц назад

thanks alot 💕💕

@techcorner8280 Год назад

Too much good explanation 👍👍👍👍👍👍👍👍👍👍👍👍

@studytable75 Год назад

Thanku😍 Kindly share the channel link with computer science students only

@SARAyhi Месяц назад

thx

@user-cr7ux1jt9u 11 месяцев назад

thank u mam super explainantion keep doing videoes☺

@studytable75 11 месяцев назад

U Keep watching my other videos as well and share the channel or video link with computer science students only 😊

@novodip247 Год назад

thank you so much

@studytable75 Год назад

Keep watching 😊

@studbanda9426 5 месяцев назад

mam how to find key attributes? it is asked in my uiniversity exam

@giack6235 2 месяца назад

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.

@hindu8212 27 дней назад

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

@ganeshlohar1709 Год назад

Using the same example

@chanlcer 4 месяца назад

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?

@studytable75 4 месяца назад

Yes mostly but you can't say never.

@ganeshlohar1709 Год назад

Mam how to find primary key using clouser method

@studytable75 Год назад

Closure method is to find candidate keys not the primary key.

@SIDDHARTHSINGH-sm2pr Год назад

why we have not found candidate key with 3 combinations?

@studytable75 Год назад

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.

@SIDDHARTHSINGH-sm2pr Год назад

i got it ma'am thanks a lot.

@studytable75 Год назад

Kindly share the channel/ video link with computer science students 😊