DBMS - Problem-1 To check Whether a Decomposition is Lossless
Vložit
- čas přidán 24. 01. 2018
- DBMS - Problem-1 To check Whether a Decomposition is Lossless
Watch more Videos at www.tutorialspoint.com/videot...
Lecture By: Mr. Arnab Chakraborty, Tutorials Point India Private Limited
To Get Certification, Click Here: bitly.ws/PXXy
Use coupon "CZcams12" to get ‘’FLAT 12%’’ OFF at Checkout.
Thank You so very much sir. You were literally the saviour in all my Rgpv Exams. Keep up the good work.
Based on the algorithm, you have explained nicely sir. Thank you
Thank you Sir... You Just Help me alot on my work
thank you sir...well explained
Awesome explained
thanku very much sir
thank you bro
But sir one previous year gate question(cs 2001) there is no relation given...only dependencies are given...how can I find the relation...
thnkuu sirr
thank you sir
Nice explained👌👌
I've a question.
Given R(A,B,C,D,E) with the functional dependencies FDs{A -> BC , CD -> E , B -> D , E -> A} are decomposed into R1(A,B,C,D) & R2(C,D,E).
Check whether the decomposition is dependency and lossless or not.
Did u get answer for this..
It will be Lossless decomposition
the another way is check for attr (r1) ∩ attr (r2)=CD which is a candidate key for r2 so it is lossless
Yeah this is lossless
This method is not at all useful for all problems,its working only for the problem you taught
Is he bangali ???
Yese