4.17 Example Practice Problem of Lossless Join Decomposition Part-2

  Рет қаралды 222,662

KnowledgeGATE by Sanchit Sir

KnowledgeGATE by Sanchit Sir

Күн бұрын

Пікірлер: 141
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Жыл бұрын
For complete DBMS, check out this video: kzbin.info/www/bejne/j4PRm3qbhsemfrM
@48_subhambanerjee22
@48_subhambanerjee22 Жыл бұрын
This lecture is "lossless" for sure sir. No time waste, straight to point perfect explanation!!
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Жыл бұрын
Thank you so much for your valuable feedback dear @Subham ❤ Keep following & do share it with your friends👍 Stay connected for more amazing contents & upcoming videos 👍
@likithr.n9692
@likithr.n9692 6 жыл бұрын
This probably was the only lecture that i understood about "loseless join".........
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Жыл бұрын
🔥Complete DBMS by Sanchit Sir: tiny.cc/DBMS_Sanchitsir_kg 🔥🔥All Computer Science Subjects by Sanchit Sir: tiny.cc/CSbundle_dbms_kg
@Sudeshsorout
@Sudeshsorout 6 жыл бұрын
Apne sir g meri bahut badi problem solve Kara Di ... Thank you sir g .... Amit sir toh pata nhi kya padhate h institute m .... Unhone aise padhaya iss method ko ... M toh usme ulajh Gaya really sir thank you very much
@devendramahilange
@devendramahilange 2 жыл бұрын
4. R1(WV) R2(WXYZ) W common hai, lekin W candidate key nhi hai. 1. R1(VWX) R2(XYZ) isme X common hai lekin X candidate key nhi hai, candidate key hone ke liye R2 me W hona chahiye na Candidate key: VW nikal rha hai
@narutoworld4k
@narutoworld4k Жыл бұрын
R1 aur R2 alg tables h aur inn dono tables m se kisi m bhi common attribute candidate key bn jati h toh lossless hoga (ik my reply to your comment is useless but for future viewer it may help)
@yraj1652
@yraj1652 2 жыл бұрын
Sir literally maza aa raha is series me. 😊 Thank you so much Sir for such content!! ❤️🙏
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 2 жыл бұрын
You're most welcome dear 😍Keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊
@WimpyWarlord
@WimpyWarlord 5 жыл бұрын
I love the way u refer us as friends
@sohammaity7389
@sohammaity7389 4 жыл бұрын
are you an idiot??
@s7s7s7s7s7
@s7s7s7s7s7 4 жыл бұрын
@@sohammaity7389 simp Lmao
@abirpaul9027
@abirpaul9027 3 жыл бұрын
@@s7s7s7s7s7 best reply
@OmitA25
@OmitA25 4 жыл бұрын
We are blessed that....we got a tutor on youtube like you..... Very nice explanation....thnku....☺
@AnonRavin
@AnonRavin 2 жыл бұрын
Hello sir, In second example 11:10 how is X candidate key? X alone cannot find W … Please correct me if I am wrong.
@devkumar9889
@devkumar9889 2 жыл бұрын
Correct
@Kasperrrr2.0
@Kasperrrr2.0 Жыл бұрын
yes, also noticed the same
@toonstore1056
@toonstore1056 28 күн бұрын
the x should be a candidate key to either R1 or R2 since x is a candidate key for R2 we can say that the decomposition was loseless
@shadabiakram5283
@shadabiakram5283 6 жыл бұрын
I hv no word sir...u r awsommm...thank u so much sir
@Sudeshsorout
@Sudeshsorout 6 жыл бұрын
Wow sir g .... Dhansu trick h g ... Lossless , lossy ki
@NEHASHARMA-qz2oi
@NEHASHARMA-qz2oi 6 жыл бұрын
There's a mistake in the first part - Q6, wherein we have the three decompositions R1(a,b,c),R2(b,c,d) and R3(d,e). You say that the only common attribute between R1 and R2 is b, but it's actually b and c both!
@GadgetMeta
@GadgetMeta 4 жыл бұрын
If B is distinct... then why we combine B with C
@PRINCE-ts3no
@PRINCE-ts3no Ай бұрын
Same thought but idk why i am replying you its been almost 5 year for your watching this lecture.. 🙂😅
@jai_shree_ram2-c5b
@jai_shree_ram2-c5b Ай бұрын
To kya dikkat hai bhai b and c dono common hai check (BC) key hai ya nahi or bo hai .....
@Sudeshsorout
@Sudeshsorout 6 жыл бұрын
Guru g m toh issey bahut bade tareeke SE solve karta tha ..... Ab toh mouj aa gayi g
@souvikchatterjee1621
@souvikchatterjee1621 5 жыл бұрын
sir you are really great..the way you explain all those stuffs its really beautiful and i becomes your big fan... and i wanna say something that if possible then please upload videos on 4NF and 5NF. Thank You Sir.
@chaitanyamogal808
@chaitanyamogal808 3 жыл бұрын
This man is god 👍
@mgudiya
@mgudiya 4 жыл бұрын
Sir your teaching is fantabulous
@zareena60
@zareena60 4 жыл бұрын
sir in 4th ques we r getting w as candidate key in R2.i think it is lossless.Plz kindly explain whether it is right or wrong
@arijitbhakta9705
@arijitbhakta9705 2 жыл бұрын
Thank you Sir for clear explaination.
@Gautamsingh-dy4cp
@Gautamsingh-dy4cp 6 жыл бұрын
how x is candidate key when finding x closure w is missing in last question
@ashishakash3249
@ashishakash3249 6 жыл бұрын
proving candidate key in one relation is enough...........see previous video 3rd property!!!!!!!
@Gautamsingh-dy4cp
@Gautamsingh-dy4cp 6 жыл бұрын
i little bt confused and thanks
@Gautamsingh-dy4cp
@Gautamsingh-dy4cp 6 жыл бұрын
coommon attribute is a candidate key at least one of the table after orignal table divide itno two parts ...thanks ashish
@ashishakash3249
@ashishakash3249 6 жыл бұрын
Gautam sonu always welcome
@parthh3963
@parthh3963 4 жыл бұрын
exactly my question!!, up to the previous examples we calculated if the common attribute is the candidate key of the parent relation but in this question suddenly we are happy with the common attribute being the candidate key of either one of the child relations.
@OmitA25
@OmitA25 6 жыл бұрын
nice explantion sir.............Sir plz start uploading videos on computer org and architecture.........
@ajitsafeway
@ajitsafeway 5 жыл бұрын
Sanchit , can we try to solve this problem , Suppose that we decompose the relation R=(A,B,C,D,E,F) into three relations- R1(C, D, E) , R2(A, B, C) and R3(A, D, F) . Find whether this decomposition is lossless, if the following set F of functional dependencies holds. F={ A->BC; C->DE; D->F}
@terabaapfragmaster4723
@terabaapfragmaster4723 9 ай бұрын
I have a confusion, here wv,wx,wy are the condidate keys. Then 4th option should also be lossless. Please help
@hsygtgh6911
@hsygtgh6911 6 жыл бұрын
mujhe achhe se samjh me aa gyi sir apka vedio
@Vedupa
@Vedupa 5 жыл бұрын
Sir really very good explanation my each nd every doubt clear regarding this topic Thankx a lot Sir!
@preethamm.n1161
@preethamm.n1161 5 жыл бұрын
🌹💞💞Awesome teaching sir 💞💞 🌹
@ankitmehta4133
@ankitmehta4133 4 жыл бұрын
love your explanation
@yash_verma
@yash_verma 2 жыл бұрын
excellent explanation
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 2 жыл бұрын
Thank you ❤ keep supporting & stay connected for more amazing contents👍😊 You can also check out our course for all Computer Science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science
@pritimishra2302
@pritimishra2302 Жыл бұрын
Sir ek bhi distinct hoga tab bhi 3rd property follow hogi?
@ordinarygirlwithdreamywing4576
@ordinarygirlwithdreamywing4576 4 жыл бұрын
Nice explanation
@manishsinghrajput4638
@manishsinghrajput4638 6 жыл бұрын
sanchit sir, please upload video on dependency preserving as early as possible..
@Jyoti_Trivedi
@Jyoti_Trivedi 4 жыл бұрын
Thank you sir.... great 🙏
@Ankit-we8ym
@Ankit-we8ym 6 жыл бұрын
Very very thanks sir aur iski jarurat thi .
@diaworld7166
@diaworld7166 4 жыл бұрын
sir 6th mr R1 and R2 saare attribute cover nhi kr rhe h E nhi h dono me ...aise ke skte h kia h sir??
@sharvanhomi5559
@sharvanhomi5559 6 жыл бұрын
Sir acha explain kya apne..... Nyc
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 6 жыл бұрын
Thank you my friend.. Satah dete raho padhte raho.. so that main aur video bana pau aap logo ke liye..
@theIndiangirlinEngland
@theIndiangirlinEngland 6 жыл бұрын
Nice explanation sir.
@Shrunkhla
@Shrunkhla 6 жыл бұрын
Hello sir, in the last option of table you calculated B as common between R1 and R2, but both of them has BC as common, still they satisfy 3rd condition?? Since C is not distinct. Please clarify.
@ujjawalmishra2702
@ujjawalmishra2702 5 жыл бұрын
take BC as key because R1 intersection R2=BC. He must have missed it.
@parthh3963
@parthh3963 4 жыл бұрын
we are not using B and C individually instead we are taking the composite key "BC", and as we know B is distinct so it does not matter if C is distinct or not because "BC" combined will always be distinct.
@radhachranverma3505
@radhachranverma3505 3 жыл бұрын
Sir last wale quetion mai x candidate key nai hai , to ye to lossi hua na
@Patitapaban_sahoo
@Patitapaban_sahoo 2 жыл бұрын
Good job
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 2 жыл бұрын
Thanks 😍 keep learning & supporting ! Do visit our website www.knowledgegate.in for more amazing courses & contents 👍😊
@codeb3nder862
@codeb3nder862 4 жыл бұрын
Haat joda mat kijiye, we are blessed by you
@mbapu_art
@mbapu_art 3 жыл бұрын
Love 😘you sir
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 3 жыл бұрын
Thanks a lot dear student.. keep learning and supporting !!
@dip1410
@dip1410 6 жыл бұрын
Brilliant sir thanks
@shriram6123
@shriram6123 5 жыл бұрын
Thanks 🙏 🙏
@sscknight
@sscknight 5 жыл бұрын
Thank you so much sir... Take a bow🙌
@Ankit-we8ym
@Ankit-we8ym 6 жыл бұрын
sanchit sir next please take on how to check fast dependency preservation .
@komalprajapati3243
@komalprajapati3243 6 жыл бұрын
Sir please...... upload the video of 4NF and5NF
@ankitathakur5989
@ankitathakur5989 5 жыл бұрын
Thanku sir ji
@alwayshappy8576
@alwayshappy8576 6 жыл бұрын
Great sir..
@gayatri263
@gayatri263 3 жыл бұрын
God bless you
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 3 жыл бұрын
Thanks a lot Gayatri..Stay blessed. Keep learning !!
@farzanabatool2728
@farzanabatool2728 4 жыл бұрын
thank you sor🌹 🌹
@arunavasaha7051
@arunavasaha7051 5 жыл бұрын
In the last example how you can fetch W by making X as a candidate key?
@sagnikbagchi
@sagnikbagchi 5 жыл бұрын
X is the candidate key for the second table. Only one condition is enough for it to prove that it is distinct he said so X isn't the candidate key of the first table.
@narendraparmar1631
@narendraparmar1631 6 жыл бұрын
Thanks sir ji😆
@bhupendradewangan43
@bhupendradewangan43 6 жыл бұрын
Thank u so much sir...
@kshitijsrivastava6148
@kshitijsrivastava6148 6 жыл бұрын
Thank you sir!
@weblocker3801
@weblocker3801 6 жыл бұрын
Thnku sir ji...
@shwetashirsat383
@shwetashirsat383 6 жыл бұрын
Thank you
@shankarkolkata22
@shankarkolkata22 5 жыл бұрын
Hello sir, in the last option of table of first question you calculated B as common between R1 and R2, but both of them has BC as common and C is not distinct, so it should be lossy.
@the_amankushwaha
@the_amankushwaha 5 жыл бұрын
yes brother
@prof_as
@prof_as 6 жыл бұрын
sir i have a question :- since here we can find C.K with the help of functional dependency here so 1st we find the C.K and then check that the decomposed tables have those keys in common or not
@AryanSingh-kt6ur
@AryanSingh-kt6ur 5 жыл бұрын
No, we cant do that because if the common attribute is C.K for any of the decomposed tables then it will be lossless decomposition but it is not necessary ki wo common attribute CK prove hojaye using Functional dependencies like in last example X is not a C.K if you find it using functional dependencies but it is CK for R2 .
@aradhanasaxena8561
@aradhanasaxena8561 6 жыл бұрын
Great
@jagmohanagrawal7636
@jagmohanagrawal7636 5 жыл бұрын
More questions on this topic will be helpful. Please upload soon if possible.
@Robert_downy
@Robert_downy 7 ай бұрын
Do them by yourself
@pritimishra2302
@pritimishra2302 Жыл бұрын
Sir kya agar ek bhi common attribute distinct ho to bhi vo lossless hoga?
@mandishdahal5650
@mandishdahal5650 5 жыл бұрын
thank u
@TheSarthak425
@TheSarthak425 6 жыл бұрын
How is X a candidate key? We cannot get W from X.
@spanishards
@spanishards 6 жыл бұрын
X is candidate key in relation R2
@Gautamsingh-dy4cp
@Gautamsingh-dy4cp 6 жыл бұрын
in r1 how it is possible
@ashishakash3249
@ashishakash3249 6 жыл бұрын
here i got the solution!!!!! common attribute X should be candidate key in either one of R1 & R2 (or) both.........refer previous video 3rd property!
@sauravjyotikalita9563
@sauravjyotikalita9563 6 жыл бұрын
Ashish Akash I think here X is only a part of candidate key....VW and XW are two candidate key
@ashishakash3249
@ashishakash3249 6 жыл бұрын
sauravjyoti kalita ........ you did not understand the question he raised ..........vw & xw are candidate keys for R(vwxyz) AND X is candidate key in R(xyz).....so x is candidatre key in R(xyz) and foreign key in R(vwx)!!understood?
@shanumishra2444
@shanumishra2444 6 жыл бұрын
sir please upload videos on ER Model
@pradhyumansinghmandloi8240
@pradhyumansinghmandloi8240 4 жыл бұрын
common attribute can be super key?? Anyone please
@VikramSingh-vy3jb
@VikramSingh-vy3jb 4 жыл бұрын
sir in the 6th question R1(ABC),R2(BCD),R3(DE). If we combine R1 and R3 we get(ABCDE) but the intersection is null since there is nothing common in between them. So it should be Lossless decomposition.
@prof_as
@prof_as 6 жыл бұрын
and one more question:- does the child tables have to have the same C.K (a table can have multiple C.K )in common to satisfy the condition of loss-less decomposition
@AryanSingh-kt6ur
@AryanSingh-kt6ur 5 жыл бұрын
bro foreign key reference hona chaiye bas
@sai-be2jq
@sai-be2jq 6 жыл бұрын
May I know why 4th option is not crct for 2nd qn...? even it contains all attributes and vw ,it is also a candidate key.
@reachrishav
@reachrishav 6 жыл бұрын
W itself is not a candidate key
@subhamsaha2235
@subhamsaha2235 3 жыл бұрын
maja aa gya
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 3 жыл бұрын
Thankyou, Visit tiny.cc/yt_kgwebsite for more such mazedar courses and content !!
@shrikant2820
@shrikant2820 Жыл бұрын
Sir thank you ❤
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg Жыл бұрын
You're welcome Shrikant! keep learning & supporting! Do visit our website www.knowledgegate.in for more amazing videos & contents👍😊
@ashutoshraj8668
@ashutoshraj8668 5 ай бұрын
But Sir candidate keys ars vw and xw so how x only be a candidate key
@travel_with_dimpi
@travel_with_dimpi 6 жыл бұрын
Sir i want more videos on dec omposition
@Ankit-we8ym
@Ankit-we8ym 6 жыл бұрын
sir please jaldi upload kijiega .
@antarbasu5342
@antarbasu5342 4 жыл бұрын
Last explaination was wrong.. please check sir, no lossless was found
@AmitYadav-nn4lz
@AmitYadav-nn4lz 6 жыл бұрын
opetion 4 is correct
@souravdhar1943
@souravdhar1943 6 жыл бұрын
"To fir chaliye suru kartehe" 🤣🤣 Inspired by Technical guruji
@aadarshmishra2504
@aadarshmishra2504 6 жыл бұрын
Maybe Technical Guruji was inspired by our Sanchit Guruji.. 🤣🤣
@ajitsafeway
@ajitsafeway 5 жыл бұрын
Also , just have one question , whether we need to find candidate key for whole schema R and then we need to check whether this candidate key is available in decomposed schema R1 or R2 , or Whether we verify whether common attribute find by rule 2 , is candidate key in R2 or R2 ?
@richidubey
@richidubey 5 жыл бұрын
Just check if it is a candidate key for the particular relation R1 or not. If it is candidate key for the entire R, then it certainly would be for R1/R2.
@ajitsafeway
@ajitsafeway 5 жыл бұрын
Yaar I need this reply as early as possible , can not wait for a month or many days.. plz help me
@pratapkumar3434
@pratapkumar3434 5 жыл бұрын
Ugc net Dec 2019 m tha ye questions
@harshagarwal2280
@harshagarwal2280 4 жыл бұрын
Does anyone notices that he speaks very similar to technical guruji
@lalkrishnajha4681
@lalkrishnajha4681 6 жыл бұрын
sir i think this video u have given...i tried this on one sum bt couldn t get the answer...
@lalkrishnajha4681
@lalkrishnajha4681 6 жыл бұрын
if u ask me then i can send u in mail that sum if u want.....sir pls don t mind
@RohanSingh-ug2tv
@RohanSingh-ug2tv 4 жыл бұрын
100th comment❤️
@prajwalprabhu025
@prajwalprabhu025 Жыл бұрын
ii watch ur videos in 2x speed 😂
@anshshah4927
@anshshah4927 4 жыл бұрын
Who's having exams tomorrow
@Sudeshsorout
@Sudeshsorout 6 жыл бұрын
Agar aap net k saare subject padhane lage toh .... M Bhagwan ki kasam kha kar kehta hu kamjor se kamjor bachha BHI net ko aik Baar m clear kar dega ..... Sachhi sir. .. m Kisi ki khaama khaa badaayi nhi karta hu ... Ap mein mujhe kuchh lagaa h tabhi m keh Raha hu g..
@aakershitsharma
@aakershitsharma 6 жыл бұрын
you save my ass man !!!
@TanmayMishra-dev
@TanmayMishra-dev 7 ай бұрын
06/09/2024
@farukj.s4824
@farukj.s4824 5 жыл бұрын
SIR YOU SPEAK TOO FAST !
@Ajay51702
@Ajay51702 Жыл бұрын
bro does you test in practically! obviously no...😡
@elChico-TV
@elChico-TV 6 жыл бұрын
Why why english tittle when you talk on another language ??? BIG DISLIKE
@krupalshah8526
@krupalshah8526 6 жыл бұрын
Bot sale, khud GATE mein appear bhi hua hai?
@NishaSharma-nd1dk
@NishaSharma-nd1dk 3 жыл бұрын
Thanks sir g
@sdeepa5746
@sdeepa5746 5 жыл бұрын
Thanks😊
@harun-or-rashid8714
@harun-or-rashid8714 6 жыл бұрын
Thank you so much, sir.
@askariaziz4163
@askariaziz4163 4 жыл бұрын
thanks
@Prabhat56682
@Prabhat56682 4 жыл бұрын
Thanks a lot sir
@andistheinforitbutso7513
@andistheinforitbutso7513 3 жыл бұрын
Thank you
@KNOWLEDGEGATE_kg
@KNOWLEDGEGATE_kg 3 жыл бұрын
You're most welcome dear student, keep learning & supporting !! Do visit our website www.knowledgegate.in for more courses & contents !!
4.18 Dependency Preserving Decomposition in DBMS in Hindi
15:48
KnowledgeGATE by Sanchit Sir
Рет қаралды 234 М.
8.16 Practice Problem on View Serializability
18:34
KnowledgeGATE by Sanchit Sir
Рет қаралды 295 М.
My scorpion was taken away from me 😢
00:55
TyphoonFast 5
Рет қаралды 2,7 МЛН
Une nouvelle voiture pour Noël 🥹
00:28
Nicocapone
Рет қаралды 9 МЛН
“Don’t stop the chances.”
00:44
ISSEI / いっせい
Рет қаралды 62 МЛН
4.16 Lossless Join Decomposition in DBMS in HINDI Part-1
16:29
KnowledgeGATE by Sanchit Sir
Рет қаралды 338 М.
3.9 Practice questions on Minimal Cover or Canonical Cover or Irreducible set
21:49
KnowledgeGATE by Sanchit Sir
Рет қаралды 237 М.
4.10 Decomposition into 3NF Third Normal Form
21:46
KnowledgeGATE by Sanchit Sir
Рет қаралды 392 М.
Lec - 39 : Lossless join decomposition in DBMS ( Example ) in Hindi
5:14
CS Engineering Gyan
Рет қаралды 48 М.
4.7 How to Decompose a relation into 2NF
15:47
KnowledgeGATE by Sanchit Sir
Рет қаралды 385 М.
3.4 Armstrong's Axioms and Inference Rules in Functional Dependency
20:59
KnowledgeGATE by Sanchit Sir
Рет қаралды 380 М.
4.13 How to Identify Normal Form Practice Question Part-1
30:33
KnowledgeGATE by Sanchit Sir
Рет қаралды 487 М.
My scorpion was taken away from me 😢
00:55
TyphoonFast 5
Рет қаралды 2,7 МЛН