Illustration on Finding Candidate Key | Example #GATE-2013 | DBMS

preview_player
Показать описание

IMPORTANT LINKS:
Both of the above mentioned platforms are COMPLETELY FREE, so feel free to Explore, Learn, Practice & Share!

Our Social Media Links:

Last but not the least, SUBSCRIBE our YouTube channel to stay updated about the regularly uploaded new videos.
Рекомендации по теме
Комментарии
Автор

9 years later, it is still helpful. thanks man

zorak
Автор

not just this video, your all videos which i watched are probably the most clear and not time consuming videos about this topic

mustafakucuk
Автор

our DBMS lecturer recommended your channel in class, thats how awesome your explaination is. thank you so much ! :D

sonubetaa
Автор

5 years later still very helpful. Thank you for posting this, it makes so much more sense the way you explained it!

dylanc
Автор

You're the goat bro
- All CS students worldwide

therealgunner
Автор

Mate, you have gifted my 10% in one of my master's papers. Really appreciate the tutorials.

kevin.michaels
Автор

8 year later, it is still very helpful

amankarn
Автор

Lifesaver. I am currently a student from UNSW and the course: database management was given by a Chinese PHD student who only knows how to read the PDF instructure without his own idea and explaination. Thanks again for helping me to crash the assignment.

brucekang
Автор

I think qus ask for finding the c.key, so by definition c.key is minimal super keys. so after taking 2 combination we have to stop, no need to proceed further.

AbhikRoy-jqib
Автор

You saved my life Just understood this few hours before my final exam..

mrk_
Автор

no other lectures give this simple explanation. In the Beginning i thought it was not effective because it is a old lecture don't think like that it is the best lecture on candidate keys😍

DileepKumar-odqn
Автор

One of the best tutorials about how to find candidate key
Thanks a lot

Ashkan
Автор

My DBMS lecturer only explained about the normalisation and functional dependencies, but did not explained the main thing i.e. hoe to find the candidate key which you explained very well. Thank you

Nikkudon
Автор

how do you choose a key from the candidates now? Can you just randomly decide which one you want to take?

lenamaier
Автор

Man you are a lifesaver as well as a timesaver!

lordxkronoz
Автор

So, to find a Candidate Key it need all the letters to be on the right hand side? And we have to try any possibility to find as much as we can?

xenioschristides
Автор

For this question:
R = (A, B, C, D, E)
A -> BC
CD -> E
B -> D
E -> A
All the attributes are present of the right side, ie, A, B, C, D, E. So do I conclude that there is no candidate key in R?

IlyasHabeeb
Автор

you teach even better than the university professor

mattkan
Автор

Your style of teaching was so understandable..

manideeptadala
Автор

Why D+ (closure) is not considered as a candidate key? In previous video you said that the attribute which is not present on the right side can be included in candidate key

aimlbakashtiwari