in Databases retagged by
4,915 views
0 votes
0 votes

Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$.

  1. $2$NF
  2. BCNF
  3. $3$NF
  4. $1$NF
in Databases retagged by
by
4.9k views

2 Comments

When the relational schema is $R(A, B, C, D)$ then what is $E$ in FD $A \rightarrow CE$ and $AE\rightarrow D$? Are attributes not present in schema allowed in FDs?
0
0
E is not present in relation but there in fd? is this possible. Can anyone please clarify this.
0
0

4 Answers

3 votes
3 votes

F = { A→CE, B→D, AE→D }

Here candidate key is: AB

The functional dependency B→D violates 2NF requirement. It is a partial dependency, D is partially dependent on B, where B is a proper subset of a candidate key.

Hence, it is in (D) 1NF

0 votes
0 votes
FD set F={ A→CE, B→D, AE→D }
AB+={A,B,C,D,E} it clearly shows that right side, there is no B. So, definitely candidate key require B.
→ The functional dependency B→D violates 2NF requirement. It is a partial dependency, D is partially dependent on B, where B is a proper subset of a candidate key.
0 votes
0 votes
Here, $AB$ is the candidate key as $AB^{+}=ABCDE$

Here $B\rightarrow D$ is a partial dependency as a prime attribute $B$ is determining non-prime attribute $D$, which is not allowed in $2$NF.

$\therefore$ The highest normal form satisfied by the relation is $1$NF

Option D is correct.

1 comment

"a prime attribute B is determining non-prime attribute D, which is not allowed in 2NF."

This statement is not correct

1
1
0 votes
0 votes
ANS : D 1ST NORMAL FORM

F={A→CE,B→D,AE→D}

CANDIDATE KEY : AB → ABCDE

IT IS PARTIALLY DEPENDENT

B→D VIOLET THE CONDITION OF 2ND NORMAL FORM

SO ,GIVEN RELATION IS ONLY IN 1ST NORMAL FORM .
by
Answer:

Related questions