1.

What Is Boyce Codd Normal Form In C++?

Answer»

A relation SCHEMA R is in BCNF with RESPECT to a set F of functional dependencies if for all functional dependencies in F+ of the form a-> , where a and b is a SUBSET of R, at least ONE of the following holds:

  • a- > b is a trivial functional dependency (b is a subset of a).
  • a is a superkey for schema R.

A relation schema R is in BCNF with respect to a set F of functional dependencies if for all functional dependencies in F+ of the form a-> , where a and b is a subset of R, at least one of the following holds:



Discussion

No Comment Found