edited by
9,888 views
3 votes
3 votes

Consider the following relation R (A B C D E) WITH FD F= (A ⇒BC, CD ⇒E, B⇒D, E ⇒A ).

How many minimum relations required to decompose into BCNF with Dependency preserving and Lossless join decomposition?

edited by

2 Answers

Best answer
3 votes
3 votes
Here A,E,BC,CD are candidate keys.

B-->D is violation of bcnf ...

Made two tables R1={A,B,C,E} and R2{B,D}..

Here it is lossless but not dependency preserving...

CD-->E is lost...so for it we will create one more relation...

So total 3 relations are required...
selected by
3 votes
3 votes

Given relation is either BCNF or Dependency Preserving.

FD F= (A ->BC, CD -> E, B -> D, E  -> A )

Here CD -> E , E ->C Because of this relation is either BCNF or Dependency Preserving.

Related questions

622
views
1 answers
0 votes
tirth_patel asked Jan 17, 2022
622 views
$(A)1$ $(B)2$ $(C)4\\$ $(D)\ 5$
776
views
1 answers
0 votes
atulcse asked Jan 15, 2022
776 views
How many minimum relations are required for the following Relation R(A, B, C, D, E) with FD {A → BC, CD → E, B → D, E → A} to convert into BCNF without violation of lossless and dependency preserving decomposition _________.
1.6k
views
2 answers
2 votes
admin asked Mar 31, 2020
1,554 views
Which one of the following statements about normal forms is FALSE?BCNF is stricter than $3$NF.Lossless, dependency-preserving decomposition into BCNF is always possible ... $3$NF is always possible.Any relation with two attributes is BCNF.
3.7k
views
5 answers
4 votes
admin asked Mar 30, 2020
3,654 views
Which one of the following statements are not correct?$S1$: $3$NF decomposition is always lossless join and dependency preserving.$S2$: $3$NF decomposition is always lossless join ... Only $S1$Only $S4$Both $S1$ and $S4$Both $S2$ and $S3$