Lec 8: Finding number of candidate keys in relation - part 2 | DBMS
Вставка
- Опубліковано 9 лют 2025
- In this lecture I have explained how to find Number of Candidate Keys in a Relation with a simple trick.
Best DBMS Tutorials : • DBMS (Database Managem...
*******************************************
Connect & Contact Me:
My Second Channel Link: bit.ly/354n7C7
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
Twitter: / khatrijenny
*********************************************
More Playlists:
C Programming Tutorials: • Programming in C
C++ Programming Tutorials: • Lec 1: How to Install ...
Placement Series: • Placements Series
Data Structures and Algorithms: https: • Data Structures and Al...
Design and Analysis of Algorithms(DAA): • Design and Analysis of...
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
#dbms #dbmstutorials #normalization #jennyslectures #losslessjoin
Indian UA-camrs are going to revolutionize education! Thanks it was much better than at university!
@@senpaijs798 me
Thanks from Buenos Aires!
A little cheat note I made from this video:
Candidate Key Discovery Algorithm
1. you have *trivial superkey* > do *functional dependency filtering (filter the trivial SK by removing the attributes which are dependents in FDs; use also the 3 AAs + 3 IRs)
2. you have *filtered super key* > do *subset check (if closure of all proper subsets don't cover all attributes, then it's a candidate key)
3. you have *candidate key* > do *dependent prime attribute replacement (generate new SKs by replacing each attribute which is a dependent in any FD, by its corresponding determinant)
4. Repeat 2. and 3. until all FDs have been exhausted and you have *all possible candidate keys and prime attributes*
older version:
Once you have a super key > do a subset check (closure of proper subsets must still cover all attributes)
Once you have a candidate key > do a prime attribute dependency check (generate new SKs by replacing dependencies by determinants)
Nice, I got this same note from Gate Smashers
You are the life savier of many students.....Im not able to notice atleast one lecture of yours as boring....YEAH ...Your teaching skills are....awesome.Every lecture of yours are WORTH watching.
Ever since i was forced to leave college I thought I would never improve in data structures and algorithms and other CS topics. Online resources are old and books are hard to read. Then I saw your channel!. Thank you so much Jenny. You're really an amazing teacher
I was actually following BDE and thought to comment, after explaining you expained that ....very thoughtful indeed
OMG!!!! It's how she explains. Wonderful Job Ma'am (undoubtedly you are the best explainer on the UA-cam) Thankyou So very much.
we just need to have logical reasoning and you give this. thanks from senegal !!
Vary easily or not complex method. And these examples all concept is clear... So thank you so much Jenny mem... 🙏❤🙏
The perfect summary of the process at: 19:29
thank you!!! i fully understood this and finally get why this works. I hope you are doing so well with your life because bless you.
mam to be honest..the guyz who would never thought to study hard ..can make it wrong, while seeing your lactures..you makes the things soo easy..keep it up, ya with your adorable smile ..😍😊
Am in Ghana and I swear the way this lady teaches is excellent
Ma'am your example is really awesome , every example teaches us something new even if knowing all primarily concepts
Didn't thought that jenny mam has dbms lecture's videos also. I have wasted my 1 hr on other yt videos, but thank god jenny mam saved me!😍
I'm curious who gave her a thumbs down. She's amazing!
Thanks for existing and making these amazing videos. SO HELPFUL!
Hi, Thanks for sharing the answer to the problem in the previous video. Really liking these lectures!
Amazing content watched multiple videos but didn't get that
Thanks a lot ❤
Ma'am
Your's lecture are too good.
It helps me lot...
keep uploading such lecture so that your student can always have a guidance to learn......
Thanks for this superb video 😌
So thank you for this miss! I gonna take a DBMS test in the next 6 days, hope I can pass it with high score!
now i have solved easily , without any problems, specials thanks to jenny maams , she give us easy and nice explaination than my college teachers...
galat hai bhai correct to karle
@@mangekyo_o kya galat he ?
Thank you mam for your support and guidance today my result is declared and I pass the exam of dsa .❤❤❤
Thank you very much for the lecture! It saved my day.
I love your teaching mam from Tamilnadu
Perfect explanation, Thanks ma'm❤❤
JazakALLAH to save me. I am lecturer and due to you I can explain this topic easily. May ALLAH bless you ameen
Thanks Mam for amazing lecture. It cleared all the concepts
Please Continue DBMS Series
Great explanation...aap ke padhane me baat h..👌
top notch lecture ma'am
jenny is our gem
Awesome 💥💥💥
Thanku so much for this awesome lecture 🙏🙏🙏🙏🙏
Thanks ma'm soo much for this valuable video...
Your teaching method is realy attractive for me
Congratulations 🎉🎉 mam for 50k subscribers 🤩😊🔥
I don't understand while C is a candidate key which is minimal so how come two attributes AD becomes candidate key?
Madam,,, i love your teaching and .... Very excellent explanation
Your eyes are magnets attracting my concentration... . Maam love You 💓
As your student!
Thank You So Much for the Detail Explanation.!!!
I want to thank you..
The way you teach hope i could be your student..
I improved myself through your lectures..
You are beautiful though in love❣️
I thought your videos are Short content only for formal education . But, After ref some gate questions . Now , I conculde you videos are more enough for gate exam too
nice video & nice teaching
Ma'am I see your videos from past 4 months , they are very much based on clear concepts and complete knowledge..but ma'am since you cracked gate I want to know that from where should I start my preparation of gate...??? Waiting... for your guidance.... ma'am
Thanks Mam. I passed my Exams!
I read in class X and I always get to learn new programming logic and new things .... Thank u maam . And I am from Kolkata thank u from Souptik Das
Thank you so much, ma'am...
Deep respect to you...
Great teaching
Thank you such helpful in exam👍
thank you mam for your unconditional efforts
you saved us
Thank You for this lecture mam
Good examples and thank you for your effort in preparing the videos
Very easily i can understand
Thank You Mam❤!
Easily explained.
Thankyou 🙂!
Thank you so much
Great teaching 😍
Exellent teaching skills mam, i learned these method😊
Thank u mam for the amazing lecture
Thank you very much for your video. At 11:30, I dont understand why C is CK, coz proper subset of C is C itself, which is both SK and its subset is SK, so how can we conclude that C is candidate key?
No proper subset of C csnt be C itself
@@krishsachdeva1105 thank you very much for your reply. I figured out on your other video about the keys. I passed the Sql class thanks to your precise courses. Cant be grateful enough for your meaningful work. Keep it up! 👍🏻 huge fan from now on. 💪💪💪
If we found that C is the candidate key which is also minimal ...then why are we taking AB as candidate key also??
At university 30 students in a class of 50 did not understand this yet paid 3000 dollars,But here over 25k people understood it yet didnot pay a penny!
Thanks mam!
Jenny mam ,
R(A,B,C,D,E)
FD: A->BC,CD->E,B->D,E->A
For this and relation,
E,A,CD,BD are candidate keys check once tell me..
today i solved your question and my candidate keys are E, CD, AD, AB and prime attributes A, E, C, D. I think your candidate keys are wrong try once again.
Tip: Before solving, decompose the RHS of the F, it will shorten the shortcut!
Ma'am ! Your videos is good . You explain well.
I request you that you should make a video on this topics that, we Prefer to use Normalize Data in Our Database System,
But why we need Denormalize data instead of Normalize Data in our Data Warehouse ???
Please Reply??
Thanks....
very nice
F: a-b,b-d Actually AcD is a candidate key then proper sub is ac ab CD a c d at replacing acd to acb if ac is super key then it can take it as ck. B is prime att or non- prime tell me please.
Vere level 🥰
Mam at 8:08 we have c->b so we can discard b from ab
Thank you madam
Mam, it would be helpful if you can give some idea about the usage of candidate keys in practice.
I think all the youtubers can start an online university for a much better price. Like Abdul sir teaches DSA, jenny mam dbms...it will be good I guess
Consider the relation scheme R(A, B, C, D, E, H) and the set of functional dependencies- A → B,BC → D,E → C,D → A Find the Candidate key.
AEH,DEH,BEH is it correct brudha🙂
Plz upload a video on finding total no of super keys for this problem!!
Mam....please make video on data structure for campus interview or interview preparation. In whole youtube video i can't find any better video for interview preparation. So please make video, student gets benefit for job
Hi Mam ... It would be a great help for students if you solve 1 or 2 gate or net questions for each imp topics ... 😁😁😁
Mam at 9:28 you changed DC to DB... Please check and correct me if I am wrong
Its okay. It will be DB
Good
isnt candidate key the minimal super key shouldnt the answer be only C
Mam plzzz continue the DBMS series
Can you do a tutorial about query optimization cost with examples ?
I will be thankful if you do it because my exam is around the corner 🙏
Mam please teach the stack overflows and underflow conditions with example
Nice haircut looking so cute in that😍😍
Please make more videos on DBMS
government should start UA-cam teachers award and must give it to you
Thanks 🙏🙇🙏🙇🙏🙇🙏🙇🙏🙇🙏🙇🙏🙇mam
Do you have classes in Mumbai. I HV done SQL at NIIT, but with limited input, is there anywhere I can learn unstructured DBMS and also Computer Networking in Mumbai. Kindly let me know.
mam i think we should always use decomposition rule first which will make our live easy, A -> BC then A -> B and A -> C which will make our solution with no mistake.
Mam hum log ac k jagah dc bhi likh skte the naa aur dc se c humara s.k hoga toh apne (ab)se hi replace kia bajae db k qqqqqq mam
❣️
rada rada
I have a question, How can C is a candidate key? isnt c is a superkey?
candidate key is a super-key whose proper sub-set is not a super-key, so a an atribute example(c) can be a super-key and a candidate-key at the same time. proper sub-set means to reduce it to its simplest value and then see if its closer is a superkey or not in c if you reduce it the closer won't have all the attributes of that relation so that is why it is a candidate key. hope it helps
I think C can also be a candidate key
13:44 DB is not a candidate key because D->A and further A-> null in FD = {AB->C, C->DE, E->F, D->A, C->B}.
Correct it mam...Appreciation for the great videos
DB is a candidate key
because D->A and in AB->C we can replace A with D since D->A so we can get {D,B,A,C} and from from C->DE we will get {A,B,C,D,E} AND FROM E->F DB+={A,B,C,D,E,F}
@@palliloksai6821 thanks for solving my confusion
Given R(ABCDE) with F(B->A, A->C, BC->D, AC->BE)
I am left with CK of (B) only since the right hand side there isn't anything that determines A but the number of CK is 2 (A, B)
How can do i know if there is another CK A by using that method?
Please Upload tower of Hanoi tracing and program
Since C is a candidate key then how can AB,AD,BC,CD be candidate key as Candidate key is the one whose number of prime attributes is minimal. Please correct me if I am wrong.
Please make video on index formula for 1D 2D 3D and nD array
Hi mam hope you r doing well please suggest best book of dbms l can follow that book with your lecture best wishes from afghanistan
Mam, DB replaced with CB, if again B is in RHS of c then we have to check for DC ? Please update with your answer