2,266 views
6 votes
6 votes
Given R(ABCDEFG) and functional dependencies

AB $\rightarrow$ C

BC $\rightarrow$ A

AC $\rightarrow$ B

B $\rightarrow$ D

D $\rightarrow$ E

Decompositions:

1. R1(ABC)  R2(ABFG) R3(BD) R4(DE)

2. R1(ABC)  R2(BCFG) R3(BD) R4(DE)

3. R1(ABC)  R2(ACFG) R3(BD) R4(DE)

Is all of these decompositions are lossless, dependency persevering and BCNF?

Please confirm. Thank you.

2 Answers

Related questions

1 votes
1 votes
1 answer
2
0 votes
0 votes
1 answer
4
night_fury asked Sep 23, 2018
731 views
The below decomposition is lossless or lossy and also dependency preserving or not?