Question

Consider the schema R=(A, B, C, D, E) and let the following set F of functional dependencies hold for R: F= {A → BC, CD → E, B D }

Answer 1

Lossless Join de composi bien/ Dan additive :- B) This property gurcentees that the extra os) LOSS tople generation problem does not occur after decomposition *) It is a mandatory pooperty must always holds Good *) If a delation R is decomposed into two Jelations RI8Ra then it will be loss Less ift j) ottori) Vatteca) =attoo) Dattr CRD n attocks) 7 TiD ottocki) n attrcka) → att rcro con att CRD 1 otto Cra) → altr CR2)

R=(A, B, C, D, E) R, CA, B, C) 8 R₂ CA,D,E) DattoCAD vatto (R2) = att&CR) CA,B,C) U CA, D, E) - CAB C,D,EDER success li attori nattrcR2) 70 CA,B,C) OCA,D,E) = A +Owc success 11 atterrat& (P2) attrcR) Cool atto CRI) a alto(R2) attr (R2) *)Commen attribute for both R18 R2 is the K. So A is the key of the Any functional dependency in the relation RICOD R2 FF ŞA>BC, CDE, B-703 Ri[A, B, C , R2 [A DE] A is the common atonture A is the common atos ABC DE is not coresed Success because in the relation R A is the key in the R by using * & But sufficient only one Pelation will be Sotesfied. So Ri is abested * It is lossless decamposition
it is lossless decomposition

Understanding third step is difficult

One relation sufficient for satisfies the relation

Practice more problems than you are perfect

Anything doubtful or not understand just comment I will touch with you

Please thumbs-up for my effort

Thank you and all the best