edited by
20,026 views
63 votes
63 votes

Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resulting set of relations is

  1. Zero
  2. More than zero but less than that of an equivalent $3NF$ decomposition
  3. Proportional to the size of F
  4. Indeterminate
edited by

7 Answers

Best answer
71 votes
71 votes

Answer is A.

If a relation schema is in BCNF then all redundancy based on functional dependency has been removed, although other types of redundancy may still exist. A relational schema R is in Boyce–Codd normal form if and only if for every one of its dependencies X → Y, at least one of the following conditions hold:

edited by
41 votes
41 votes
should be zero..
BCNF can have Multi valued dependency but no redundancy due to FDs..
edited by
6 votes
6 votes
Yes , the answer should be zero. There should not be any redundancy due to FD in BCNF.
edited by
1 votes
1 votes

Explain please

BCNF can have Multi valued dependency but no redundancy due to FDs

Answer:

Related questions

54 votes
54 votes
6 answers
2
Kathleen asked Sep 15, 2014
16,627 views
From the following instance of a relation schema $R(A,B,C)$, we can conclude that:$$\begin{array}{|l|l|}\hline \textbf{A} & \textbf{B} & \textbf{C} \\\hline \text{1} & \...