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

0 votes
0 votes
Increasing order of redundancy:

4NF < BCNF < 3NF < 2NF < 1NF < un-normalized

Answer is B.
0 votes
0 votes

The 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 iff for every one of its dependencies X → Y, at least one of the following conditions hold:

  • X → Y is a trivial functional dependency (Y ⊆ X)
  • X is a super key for schema R
–1 votes
–1 votes
in above question, I don't understand the meaning of ( arising out of functional dependencies ) I am thinking like "arising out of" mean, not due to functional dependencies and you all explained that it due to functional dependencies how to get it please help ?
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} & \...