589 views

3 Answers

Best answer
2 votes
2 votes

R(ABCDEG)

AB->C 
AC->B
BC->A

AD->E
B->D

E->G

R1(ABC)   AB->C, AC->B, BC->A
R2(ABDE)  AD->E B->D 
R3(EG)    E->G

We got all dependencies back, hence this decomposition is Dependency Preserving.

Join R2 and R3, E is common b/w R2 and R3, and E is CK for R3(lossless condition satisfied)
=R23(ABDEG)  

now join R23 and R1, AB is common b/w both AB is CK of one relation( lossless condition satisfied)

R(ABCDEG)  

This decomposition is both lossless and D.P hence option (A) is correct.

selected by
3 votes
3 votes

Option 1 is correct.
Lossless and Dependency Preserving

0 votes
0 votes
lossless and dependency preserving

dependency preserving........

ABC                                        ABDE                                      EG

AB->C                                     AD->E                                      E->G

AC->B                                     B->D

BC->A

candidate  keys=AB,AC,BC                    primary key=AB                                                   primary key =E

LOSELESS..........

common attribute between ABC and ABDE= AB

AB is primary key for ABC

common attribute between ABDE and EG=E\

E is primary key for EG

Related questions

0 votes
0 votes
1 answer
1
vivek1211 asked Mar 12, 2023
668 views
given an instance of relation R(ABC). find all non-trivial FDsare AB->C, AC->B, BC→ A true ??
6 votes
6 votes
5 answers
3
2 votes
2 votes
0 answers
4