467 views
1 votes
1 votes
a relational schema R (A, B, C, D) is decomposed into (A, B), (B, C), (B, D). If functional dependencies A → B, B → C, C → D and D → B were present in R, is the decomposition preserving dependencies?

3 Answers

Best answer
2 votes
2 votes

It is dependency preserving:

Ref: https://gateoverflow.in/3371/gate2008-it-61

Given FDs are transitive. B → C, C → D = B → D. Hence keeping B → D preserves B → C and C → D similarly C → B preserves C → D and D → B

  • R1 (A, B), gives A → B
  • R2 (B, C) gives C → B                              // C → D and D → B
  • R3 (B, D) gives B → D                               //Hence B → C and C → D

Hence it is Dependency preserving.

selected by
0 votes
0 votes
functional dependency C->D is not possible in decomposed realtions R1(A,B) , R2(B,C) and R3(B,D). So decomposition is not preserving dependencies
0 votes
0 votes
$A\rightarrow B$ dependency preserves

$B\rightarrow C$ dependency also preserves

$C \rightarrow D and D \rightarrow B$

i.e.$C \rightarrow B$

But there is no cyclic dependency.

So, this one not preserving dependency

Related questions

0 votes
0 votes
1 answer
2
learncp asked Jan 22, 2016
801 views
Given relation and the FDs applicable on it. How to check whether a given decomposition is lossless and dependency preserving?I know that for lossless we can easily chec...
0 votes
0 votes
1 answer
4
night_fury asked Sep 23, 2018
763 views
The below decomposition is lossless or lossy and also dependency preserving or not?