Register

made easy test series - lossless join and dependency preserving

1,020 views

1 Answer

Best answer
5 votes
5 votes
Lossless: B is the intersection between two tables and B is the key in table 2.

Dependency preserving :
FD on R1 : A -> B

FD on R2 : B->D and D -> BC

union of these two can cover original FD set.

Hence dependency preserving.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
night_fury asked Sep 23, 2018
763 views
lossless and dependency preserving decomposition #testseries
The below decomposition is lossless or lossy and also dependency preserving or not?
The below decomposition is lossless or lossy and also dependency preserving or not?
User Avatar
1 votes
1 votes
1 answer
3
Lakshman Bhaiya asked Nov 20, 2018
2,058 views
Functional preserving
Given $R(A,B,C,D,E)$ and $F:\left \{A\rightarrow BC ,CD\rightarrow E,B\rightarrow D,E\rightarrow A\right \}$,Decompose into $BCNF?$ $(a)$Every $BCNF$ is $3NF$ and vice versa $?$ $(b)FD$ preserving or not$?$ $(c)$ Lossless decomposition or lossy decomposition?
Given $R(A,B,C,D,E)$ and $F:\left \{A\rightarrow BC ,CD\rightarrow E,B\rightarrow D,E\rightarrow A\right \}$,Decompose into $BCNF?$$(a)$Every $BCNF$ is $3NF$ and vice ver...
User Avatar
Link Copied!