Finding Candidate Key | Database Management System
Vložit
- čas přidán 30. 08. 2014
- Step by step guideline to proceed with finding candidate key. To ask your doubts on this topic and much more, click on this Direct Link: www.techtud.com/video-lecture/...
IMPORTANT LINKS:
1) Official Website: www.techtud.com/
2) Virtual GATE: virtualgate.in/login/index.php
Both of the above mentioned platforms are COMPLETELY FREE, so feel free to Explore, Learn, Practice & Share!
Our Social Media Links:
Facebook Page: / techtuduniversity
Facebook Group: / virtualgate
Google+ Page: plus.google.com/+techtud/posts
Last but not the least, SUBSCRIBE our CZcams channel to stay updated about the regularly uploaded new videos.
When the random Indian teacher save you from final exam.
My indian king
@@kat_enj Yo he literally saved me. I passed the exam and now I already graduated. Thanks to this Indian Man.
@@groomyClaimbodog i failed my exam from dmbs today :(( I missed one point. But still have 2 more attempts
@@kat_enj oh no I gotchu bro. You still got 2 more attempts. Keep working bro.
@@kat_enjdid you pass?
Dude I was about going to give up and get sleep, until I clicked this video as "last chance" and you explained in 4 minutes, thank you!
Portugal crlh
@@SaNdR0RM46 Portugal fds
did you pass the exam 4 years ago?
@@leonelmessi3010 lollll
@@SaNdR0RM46 calou
simple and well explained, thank you my man!
45 minute lecture solved in 3 minutes. You're getting a like from me
me too
when an indian dude explains in 4 minutes what a teacher couldn't do in hours
This is the spirit of the internet.
I know right.
Beacuse in class many number of students
This video is from 2014 and we are here in 2023
I had no idea about the subject and the exam was next day
That clear it much thanks man
Thank you for making this soo accessible amazing! Great example, thank you so much!
Absolute legend just saved me after I couldn't understand my professor 1 hour lecture on this
Thanks a lot. I was confused during my lecture hours. but u made it easy ...
I subscribed man....You saved my DAY
KEEP UP THE GOOD WORK!
thank you for your straight to the point explanation
omg thank you bro I like ur accent stay healthy bra, when you read this 5 years ago maybe I ll have my bachelor and will comment again see yaaaaaa
we are all waiting lol
Alright, now update us.
Thanks for saving my weekend in 4 minutes!
This is the video that I was looking for. I got it now.
Fantastic explanation, you helped me a lot. Thanks!
Thank you, great video!
Thanks you are great , you helped me a lot
thank you so much for this video. You're the best.
WOW. Thank you so much!
Great explanation!!! Thank you!!!
Thks a lot bro...cool lecture..i like it
God bless u for this excellent video
you are a hero to the masses
Thank you so much .. you make it clear for me :D
ههههههههه يا ... شنو هذا
Awesome explanation
I have an instance where one of the attributes from the candidate key showed up on the right side but it was proven to be a candidate key because the closure contained all of the attributes.
How do you go on finding other candidate keys on such scenario. Do you add another attribute to make them three or you only work with 2 in case you don't get to the answer on the first attempt
Great content brother ......
Well done! Mate
You bless god, my Indian bro !!!
Thank you sir , for best explanation ....
It is very helpful for me... Best video
Thank you sir. It helped me alot
How should we find "all" candidate keys of R i.e. not stopping after finding just the first one i.e. when should we be satisfied that... "yes! there can NOT be any more candidate keys in this relation"
Thanks for the great explaination
Thank you sooooooo much king
So helpful thank you!!!! :)
Very nice explanation 👌👌👌👌
What about DCA? Would it be a candidate key?
If all the attributes appear on the left, do we just choose a random attribute and perform a closure on it?
What he said is that you should look at the right hand side and check if there are missing attributes. If they are then the closure of those attributes is a kandidate key. If all the attributes are present in the left side then there may be is more than one key ?
Thank you sir
Tq.
Clear explanation
Thanks man
what if all the attributes are also present on the right hand side? then what?
thank you !
Thank you!
thank you nice tutorial. Can you please explain, why bother to combine columns to create keys when it is much quick to add another auto-increment column that also guarantees uniqueness?
It could take too much space to add a seperate column for that, space vs time is always an issue
isn't it slower to combine two columns together (if both columns are string type) rather than a dedicated integer atomic native type?
Dexter Aparicio
I think the dedicated integer is always faster, especially when indexed, but it costs more space (although little). Each DB manager/creator should consider the pros/cons of both options for each application.
Thnx a lot
thank you
Short and best 🤩🤩🤩🤩
But AE is not akey?
supeup thoughts
what is simple candidate key. plz tell
what if the set containing AE (proposed candidate key) does't determine all the other attribute?? shoud we still call it a candidate key?
so in that case we can't call it candidate key.... :P
Thanks!!
you too bruhh
😂💔
What if we have all the attribute in the right side??
find all possible candidate keys right? then is only one possible ? what about others
I jst got ma mind fitting concept while kst going to give up thank you 😊
prefecto
is candidate key is primary key..?
what would happen if every attribute appears on the right hand side
Super bro
holy shit thank you very much you are saving my ass
When the ride side will have all the elemants in a relation how can we then calculate candidate key
wondering this aswell...
Nah mate I actually love you
Wowwww
Why you people are not using an example of table
🐐
Anyone know?
Find D' if D = (F' + G H)E
So hard to understand accent.
Find the closure and candidate key of this R(l,m,n,o,p) L->mn, NO->p, m->o, p->l
detur mind
faltu
Wrong information provided instead of fixed deposit he is saying functional dependency
Report him
Also he is not aware of alphabetical order
thank you
thankyou so much sir
Thanks sir