Hahahha.. Thank you so much Malay.. You are first of a kind who can think this.. Actually it is impossible to upload all the subjects and topics all at a time but yeah I do try as much as possible as soon as possible.. But yeah i take the requirements of the positively that yes they are waiting for the videos, that gives me energy to work.. Thank you for considering the thought buddy..
@@KNOWLEDGEGATE_kg No problem. Great work on the videos, BTW. I've seen very few people who can explain a topic as clearly as you do. I know the amount of work required for this (since I teach, too: Python programming), and totally appreciate it. Kudos!
No matter you do 6months a video No matter you put 10 BackToBack ads instead of 2 (and yes Ads are distracting us from studies) BUT Don't leave the playlist incomplete. Grateful for free content BUT at the same time we end up wasting our time searching complete parts if ur list is incomplete. We have liberty to complain you, BECAUSE we pay you indirectly by viewing ads and consuming our INTERNET PACK the costs money. @@KNOWLEDGEGATE_kg
Sir m in topics ko chhod deta thaa ... But ab nhi chhodunga .... Apne bataya hi itne seedhe tareeke SE ki jabadasti Yaad Jo Gaya g .... Only video dekhne se hi
BD closure will give you BDC since only the attributes present in second relation could be written.When final testing is done we have to obtain the same FD closure of F from closure of union of F1 and F2.
Hello sir, अच्छी प्ले लिस्ट है, आपके लेक्चर 4.18 के लास्ट में कुछ example देने वाले थे वो वाला लेक्चर missing है, अगर आपके पास लेक्चर पड़ा है,तो कृपया आप लेक्चर अपलोड कर देवें। examples आपसे समझे तो भूलेंगे नही, और किसी के लेक्चर में दम नही लगता, धन्यवाद।
@8:05 How is it possible like (F1 U F2)^+ = F^+ = C^+. It seems that you have not explained procedural steps for doing this type of problem. Sometimes, it seems that studying from standard book is also necessary for gate exam
When we do the union of F1 and F2 and try to find out that AB -> CD holds true or not, then we see that AB+ ={AB} as BD determines C in decomposition.. here BD -> AC can be formed not AB->CD Hope this statement clears your doubt
you are going awesome! but there's a feedback for you... Just want you to lower the rate of speech. because I am not able to understand concept in a one time watch.........Thanks
Hello Sir, I have 1 confusion with 1 nf, I use korth's book to study normal form ,korth says in 1 NF domain should be atomic,and further he explained that attribute should not be composite,he didn't mentioned it should not be multivalued.and also in 4 normal form we check for multivalued dependency. What should be the correct ans.Plz help me to cure my confusion.
Hello Sindhubala!! As u were having confusion, so here is the solution: It is true that 1nf should not have composite attribute because it will create null valued space in table. ex; consider a table of student and its courses, and consider the attibute course is composite of two course: course1 and course 2. It may be that many of the student may opt for only one course so null value will be stored in course 2 attribute this will create redundancy of letter 'null' , and to remove the redundancy was our objective in 1nf, or this we will form diferent tables for each of these composite attribute. In 4nf we check for multi valued dependency because it is more standard to bcnf ,ultimately we want to reduce the redundancy throughout different normal forms. Consider a table of three attribute- student class and subject, subject and class independent to each other. a student may have many subject so while representing this to table we will combine value of class and student to each value of subject this will create a redundancy in class as well as student . so we make diff table for these two. Hope you got your answer, I am surprise to see no one find it necessary to give answer in these years.
How in 3rd example have such decomposition. AB is the candidate key, and if you do decomposition based on candicate key and FDs then one should get R1(ABC) and R2(AD) as lossless decomposition. Decomposition given in your example is wrong as it is not lossless decomposition, it is in fact loosy decomposition.
For complete DBMS, check out this video: ua-cam.com/video/YRnjGeQbsHQ/v-deo.html
It's funny how the people here expect him to upload videos on all GATE topics. Come on, give the man a break. He's only one and can only do so much.
Hahahha.. Thank you so much Malay.. You are first of a kind who can think this.. Actually it is impossible to upload all the subjects and topics all at a time but yeah I do try as much as possible as soon as possible.. But yeah i take the requirements of the positively that yes they are waiting for the videos, that gives me energy to work..
Thank you for considering the thought buddy..
@@KNOWLEDGEGATE_kg No problem. Great work on the videos, BTW. I've seen very few people who can explain a topic as clearly as you do. I know the amount of work required for this (since I teach, too: Python programming), and totally appreciate it. Kudos!
No matter you do 6months a video
No matter you put 10 BackToBack ads instead of 2 (and yes Ads are distracting us from studies)
BUT
Don't leave the playlist incomplete.
Grateful for free content BUT at the same time we end up wasting our time searching complete parts if ur list is incomplete.
We have liberty to complain you, BECAUSE we pay you indirectly by viewing ads and consuming our INTERNET PACK the costs money.
@@KNOWLEDGEGATE_kg
People like you don't deserve anything for free. Nobody begged you to watch his videos, just go ahead and get a paid tutor and stop complaining.
Yes, we are worried about him as well. But you expect the most from the one you truly love.
🔥Complete DBMS by Sanchit Sir: tiny.cc/DBMS_Sanchitsir_kg
🔥🔥All Computer Science Subjects by Sanchit Sir: tiny.cc/CSbundle_dbms_kg
Sir m in topics ko chhod deta thaa ... But ab nhi chhodunga .... Apne bataya hi itne seedhe tareeke SE ki jabadasti Yaad Jo Gaya g .... Only video dekhne se hi
Great job Sanchit bhai....yahan koi neta nahin bana....hahaha...frankly speaking now i know normalization completely and credit goes to you bhai ....
best ever explanation and easiest to recall and remember
Thanks a lot dear 😍Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊
"Gobar Milega"
"Vaada kariya bhulenge nahi"
has become my new slangs after watching each and every lecture of yours.
sir at the end of video mai hath mat joda kijiye ..aap hme sarminda krte hai aisa krke ...you are great ....
i came here to find this comment only
Thank you sir❤
Sir I have a doubt at 14:17 if we use pseudo dependency that is D finds A... BD finds CD then BA Finds CD hence dependency preserved
s u are right i think so
Yes🎉
Best content sachit sir...❤❤
U have preserved A1 content of dbms in your playlist...
Thanks a ton sir
Thank you so much Himani, keep learning & stay connected for more amazing upcoming contents👍😊
Sir your explanation is much better than any teacher on UA-cam....
you are an angel.. my concepts are cleared now😃
thank u so much sir...please upload more video on concurrency control.....
Thanks sir g
Very nice sir...your video is very helpful..thanks alot..and please upload videos on R and SQL if possible
Thank you so much sir .. you saved me
Happy to help, For more courses and content, visit tiny.cc/yt_kgwebsite👍
great explanation...........sir when you will start uploading videos on Computer org and arch.
Thank you very much sir for these valuable video series. Please upload more videos in DIGITAL ELECTRONICS and also start microprocessor.
So many concepts resolved.
Thanks sir ji😆
Sir,u are great. U made everything easy :)
east or west ,sanchit sir is the best😘
Thanks for making it so simple. Same example aur kahi pe samjh nai aya tha but you made it so easy :)
great sir
in the 2nd relation, we can take d->a and then ab->cd.
There fore ,it can be dependency perserving
a is not their in 2nd relation.
sir jo table R1 and R2 divide kar rahe usme parent table ke kaun se attributes lene hai vo kaise decide kre
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!THANKS A LOT!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Sir, in last example BD CLOSURE DETERMINES BDA,THEN AB DETERMINES CD, So we may say that the dependancy is preserved???
BD closure will give you BDC since only the attributes present in second relation could be written.When final testing is done we have to obtain the same FD closure of F from closure of union of F1 and F2.
Great video sir
Super lecture sir. Thank you very much.
where i can find the practice questions of this topic by sanchit sir
?
Sir, you are grate.
Hello sir . plz upload videos on relational algebra
concept clear
Nice sir ... Thanks for such videos
Dekho sir ab mujhe net jrf ki ummeed ban gayi h jab SE apke lecture se padhai Kar Raha hu
Hello sir,
अच्छी प्ले लिस्ट है, आपके लेक्चर 4.18 के लास्ट में कुछ example देने वाले थे वो वाला लेक्चर missing है, अगर आपके पास लेक्चर पड़ा है,तो कृपया आप लेक्चर अपलोड कर देवें। examples आपसे समझे तो भूलेंगे नही, और किसी के लेक्चर में दम नही लगता, धन्यवाद।
Dear Mohit, for complete course on DBMS, please check out the link given below:
www.knowledgegate.in/learn/DBMSbysanchitsir
Dil se thanks I have exams and I need it so much
@8:05 How is it possible like (F1 U F2)^+ = F^+ = C^+. It seems that you have not explained procedural steps for doing this type of problem. Sometimes, it seems that studying from standard book is also necessary for gate exam
The first lecture of yours that i didn't understand.
kya hum ye bol skte hai ki hum F1 & F ka and F2 & F ka equivalance check kr rhe hai?
Sir awsome video.
Thank you sir
Thnkuu so much sir
sir, if possible Add one more example on Dependency preserving
Thanku sooo much sir for valuable video .
But sir i need more videos on this topic so plz.... Uploads
Sir, you are awesome. Please do more videos on tree and graphs.
Sir plz upload more practice problem videos on dependency preservation
sir sometimes in question they asked "whether bcnf is a dependency preserving or not ? "
no it is not!
SIR, in last example BD CLOSURE DETERMINES BDA,THEN AB DETERMINES CD, HENCE FD PRESERVATIVE
When we do the union of F1 and F2 and try to find out that AB -> CD holds true or not, then we see that AB+ ={AB} as BD determines C in decomposition.. here BD -> AC can be formed not AB->CD
Hope this statement clears your doubt
Should the decomposition be dependency preserving to normalize into higher Normal Forms?
from 1nf to 3nf,it will be always preserving and from 3nf to bcnf,it is not mandatory
@@yashmundra8497 i think it is not mandatory.so may be if we lost dependency then automatically it will come in higher forms.
Sir its practice questions video still not uploaded. Can you, please make it?
Really gd one...
great
Sir can upload more video on FD preservation
Some practice q sir please
Sir ye losless kaise hoga D candidate key kha h
you are going awesome! but there's a feedback for you... Just want you to lower the rate of speech. because I am not able to understand concept in a one time watch.........Thanks
Hello Sir, I have 1 confusion with 1 nf, I use korth's book to study normal form ,korth says in 1 NF domain should be atomic,and further he explained that attribute should not be composite,he didn't mentioned it should not be multivalued.and also in 4 normal form we check for multivalued dependency. What should be the correct ans.Plz help me to cure my confusion.
Hello Sindhubala!! As u were having confusion, so here is the solution: It is true that 1nf should not have composite attribute because it will create null valued space in table. ex; consider a table of student and its courses, and consider the attibute course is composite of two course: course1 and course 2. It may be that many of the student may opt for only one course so null value will be stored in course 2 attribute this will create redundancy of letter 'null' , and to remove the redundancy was our objective in 1nf, or this we will form diferent tables for each of these composite attribute.
In 4nf we check for multi valued dependency because it is more standard to bcnf ,ultimately we want to reduce the redundancy throughout different normal forms. Consider a table of three attribute- student class and subject, subject and class independent to each other. a student may have many subject so while representing this to table we will combine value of class and student to each value of subject this will create a redundancy in class as well as student . so we make diff table for these two.
Hope you got your answer, I am surprise to see no one find it necessary to give answer in these years.
How in 3rd example have such decomposition. AB is the candidate key, and if you do decomposition based on candicate key and FDs then one should get R1(ABC) and R2(AD) as lossless decomposition. Decomposition given in your example is wrong as it is not lossless decomposition, it is in fact loosy decomposition.
sir please practise questions
👍
Why you didn't upload functional dependency questions????
Sir iske or example nhi bnaye apne
Sir I have a database in .csv format can u help me to covert it into 3 Nf
Sir pls talk in english
Kal exam hai DBMS ka.... 😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭😭
Mera parson
Mera aaj
Sanchit gençliğimi sömürdün biliyorsun değil mi ?
Sir please decrease the ads in your videos it's very distracting for the students who are listening with lot of attention.
Sir sab kuch thik hai lekin aap bht fast fast bolte hai
Dhyan rakhenge Amtitesh next time..
Sir aap bahut achhe se explain kiye hai each and every topic
I have watched your all gate videos
Thank you sir
If you feel he is fast you can decrease the speed of the video. I watch at 1.5x you may watch it at .75x
I watch at 2×
Bekar
Thanks sir
Thank u sir