retagged by
469 views
3 votes
3 votes
Consider the following relational schema $R(ABCDEFG)$ with $FD$ set $\{AB → C, BC → A, AC → B, B → D, D → E\}$. The minimum relations required to decompose $R$ into $BCNF$ which satisfy lossless join and dependency preserving decomposition is ________.
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
4 votes
4 votes
2 answers
2
uzumzki asked Aug 11, 2015
5,845 views
The following functional dependency hold for relations R (A,B,C) and S(B,D,E):FD FOR BOTH THE TABLES B - A, A - C The relation R contains 200 tuples and the relation s c...
0 votes
0 votes
0 answers
3