Lec-37: Dependency Preserving Decomposition in DBMS | Example 2 in Hindi
Vložit
- čas přidán 13. 02. 2020
- 👉Subscribe to our new channel: / @varunainashots
In the dependency preservation, at least one decomposed table must satisfy every dependency. If a relation R is decomposed into relation R1 and R2, then the dependencies of R either must be a part of R1 or R2 or must be derivable from the combination of functional dependencies of R1 and R2.
►Database Management System(Complete Playlist):
• DBMS (Database Managem...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
• Design and Analysis of...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Operating System:
• Operating System (Comp...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on CZcams: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmashersofficial
► Follow us on Threads: www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
Love 💗 and respect from 🇵🇰
In simple words firstly we check the validity of Functional dependencies (FDs) of decomposed tables matching them all FDs with original FDs on top to find the real and valid FDs of decomposed tables and then secondly we map the FDs of original table down to decomposed table FDs to determed wether they are preserved or not.
one of the best channel in youtube india for gate students
awesome
BEST BEST BEST
THANKU FOR THIS AMAZING COURSE SIR❤
Very well done.....super explanation🙂
This is some explanation....
Varun sir
very nice explanation, your lectures are really awesome for competative examinations,
I'm learning from your lectures and solving competitive problems very easily.
What is your name bro?
bahut badhiya bhaiya!!!
Dhanywaad 😊
Thank you sir 🙂
This example was very good.
Thanks great video sir
Sir ye same question net m aaya tha good explanation
u are amazing sir
Nice video sir
Thank you sir
Thank you so much Sir aap bhot bhot achche teacher hain aapki vajah se subject se dar nhi lgta😊
Very nice explanation
One doubt, while determining the FDs for R2 table (BCD), why did we not consider the simpler FDs like B -> C, C -> B, C -> D, D-> C, B -> D and D -> B?
As per decomposition property, B->CD is equivalent to B->C and B->D. Hence cases mentioned by you are covered.
@@niharkajla8234 thank you bro for help
@@niharkajla8234 but if b->c is true and b->d is false then it will give wrong answer n?
@@niharkajla8234 Thanks
@@niharkajla8234 Thank You bro for the help
Thanks man❤
great Thanks
thanks,sir
I start your videos, by liking it first, hope everyone does the same and put a comment and you get enough engagement to spread your videos a lot
Thx sir 😊
Thankyou sir
Thanks sir
You deserve more than you deserve sir ❤️🤗
danyavad
Sir also make vedio on stored procedure , function,trigger and error handling and cursor it very helpful....
very good
Thx sir
Happy teachers day 💐💐💐
Sir please make tutorials for engineering maths as well
Select count(thx) as for_sir from student
--ans
--100
Nice
Thnkss alott sir..
Legitimate Sir. Sir please make videos on information security course.
☺️☺️🙏
Is this a lossless or lossy decomposition ?
Sir, one request 🙏🙏.. KVS/NVS/DSSSB TGT/PGT(CS) ki classes start kriye... According to its syllabus.
Becoz apke content important and understandable hote h... And i search many CZcams channels but... Kisi ki complete series nhi h...
Esliye.. Sir🙏🙏
Sure...
@@GateSmashers Hm apke aabhari rhenge... Sir 🙇♂️
Sir is this the only method to solve this ques..... Or we can solve. It by key concept like in R1 and R2 D is common so D should be key in any of the decomposed relation sir plz reply I m right or wrong
@seema dahiya But in the above example after decomposed into two table D is common .. Have u achieved dependency preserving decomposition...
where can i find practice questions of this topic?
Sir in this question, isn't it given that D->A and BD->C, so won't it be BA=BD, and then BA->C, so we will achieve the original FD
Please help
Same question
Please help sir
For Pseudo Transitivity there should X->Y and WY->Z then we can say WX->Z. I hope its helpful.
Sir, at 4:57 (BC) will also satisfy from BC->D
Check consciously , there only One error that is CD is CD->{c ,d ,b a } there sir not consider this I don't know why
sir can you please tell if given decomposition is dependency preserving or not. X(PQRS) FD= { QR -> S, R -> P, S -> Q} decomposed to Y(PR) AND Z(QRS) this question is from gate 2019
No its not preserving.S->Q is not preserving.
@@suchismitadalal1693 actually S->Q is also preserving if we see carefully. So dependencies are preserved in this question.
@@aloksinghrathore2791 No S -> Q is not preserving.
@@meghabagri7370 han I got it later..! Thanks
czcams.com/video/znx6ifkIQgY/video.html
Subscribe
Sir piz ooad subject per lectures start karay
sir ji why you did not took like B->C,B->D...... individually, would you please explain.
Bro what does B->CD means, we can write it as B->C, B->D that's why he didn't write it down
if D -> A and AB-> CD so DB -> CD . Is it not possible ??
mera bhi ye hi doubt hai bhai ? so did he make a mistake or you cant do it his way😭?
@@GeetChhabra-hx5gt you can do it this way infact AB->CD also means A->C and B->D
Hello sir, I want to do mba through distance education as my graduation percentage is only 44% .. So can u pls tell me university or Institute which is good in distance
Bcoz I enquired in Narshimunjee and suresh gyan vihar university but totally confused.. Plz help
tera kuch nanhi hoga
Sir short tricks koi batyei issmei time kafi lgega..NET exam
m time km rhta h