retagged by
695 views
1 votes
1 votes
relation schema with no non trivial fd's then relation is always in bcnf.

please someone explain this i am not able to get it.
retagged by

2 Answers

2 votes
2 votes
If a functional dependency X->Y holds true where Y is not a subset of X then this dependency is called non trivial Functional dependency

so with no non trivial dependency we will have only trivial dependencies such  as A->A or A-> phi..

so for BCNF we need A->B where A is a superkey so we will have the whole table as a Primary key and no partial or transitive dependencies will be there because we have no non trivial dependencies.
1 votes
1 votes
bcnf means for every x->y present in fd set  x must be sk or ck........

and no non trivial fd means there is trivial fd so for every x->y x is superset of yand hence is bcnf ...and for more just frame a example using needed conditions ..

Related questions

1 votes
1 votes
0 answers
1
JAINchiNMay asked Dec 1, 2022
443 views
Any attribute(s) determining a prime attribute, automatically becomes a prime(s) attributeTrue or false
1 votes
1 votes
0 answers
3
Manisha Jaishwal asked Jun 5, 2022
469 views
Consider the relation R(ABCDE) with the FD set F={A >E,BC >D,E >CD} . find the 3NF decomposition .
2 votes
2 votes
1 answer
4