Consider a relation RA- B- C- D- E with functional dependenciesF- A - B- BC - E- ED - AHow many additional relations required to convert it into 3NF with lossless and dependency preserving-

(a) R( A, B, C, D, E) F = {A → B, BC → E, ED → A} (CDE)^* ={A, B, C, D, E} (ACD)^* ={A, B, C, D, E} (BCD)^* ={A, B, C, D, E} Now, A, B, C, D, E are prime at ...

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Byju's Answer

Other

Decomposition Examples Part - 2

Consider a re...

Question

Consider a relation R(A, B, C, D, E) with functional dependencies

$F = {A \to B, B C \to E, E D \to A}$

How many additional relations required to convert it into 3NF with lossless and dependency preserving?

Open in App

Solution

(a)
R( A, B, C, D, E)

$F = {A \to B, B C \to E, E D \to A}$

$(C D E)^{} = {A, B, C, D, E}$
$(A C D)^{} = {A, B, C, D, E}$
$(B C D)^{*} = {A, B, C, D, E}$

Now, A, B, C, D, E are prime attribute. So, surely the since, the relationship is already in 3NF.

Suggest Corrections

Similar questions

Q. Consider a relation R(A, B, C, D, E) with functional dependencies

F = {A \to B, B C \to E, E D \to A}

Number of additional relations required to convert it into lossless, dependency preserving 3NF decomposition__________

Q. Consider a relation R(A,B,C,D,E,F) with functional dependencies
F =(

A \to B C

B \to E

D \to A F

F \to C

B \to A D

)

The number of super keys present in the relation are ________

Q. Consider the following statements given below:

S_{1}

: There is always possible a lossless, dependency preserving BCNF decomposition.

S_{2}

: Any relation with two attributes is in BCNF.

S_{3}

: For two relation R(A, B) with functional dependency F = {A

\to

B} and S(B, C) with functional dependency

F = {B \to C}

, natural join of R

▹ ◃

S is in BCNF.

Which of the following statements are true?

Q. Consider the following functional dependencies for relation R(A,B,C,D,E) and find normal form

A B \to C D, D \to A, B C \to D E

Q. Consider R(A, B, C, D, E) be a relation schema with the following functional dependencies:

F = {A \to B C, C D \to E, B \to D, E \to A}

Which of the following is true for decomposition of R into (A, B, C) and (C, D, E)?

Join BYJU'S Learning Program

Consider a relation R(A, B, C, D, E) with functional dependencies F={A→B, BC→E, ED→A} How many additional relations required to convert it into 3NF with lossless and dependency preserving?

(a) R( A, B, C, D, E) F={A→B, BC→E, ED→A} (CDE)∗={A,B,C,D,E} (ACD)∗={A,B,C,D,E} (BCD)∗={A,B,C,D,E} Now, A, B, C, D, E are prime attribute. So, surely the since, the relationship is already in 3NF.

Consider a relation R(A, B, C, D, E) with functional dependencies

$F = {A \to B, B C \to E, E D \to A}$

How many additional relations required to convert it into 3NF with lossless and dependency preserving?

(a)
R( A, B, C, D, E)

$F = {A \to B, B C \to E, E D \to A}$

$(C D E)^{} = {A, B, C, D, E}$
$(A C D)^{} = {A, B, C, D, E}$
$(B C D)^{*} = {A, B, C, D, E}$

Now, A, B, C, D, E are prime attribute. So, surely the since, the relationship is already in 3NF.