Consider a relation RA- B- C- D- E- F- G and set of functional dependencies F-F- BCD- A- BC- E- A- F- F- G- C- D- A- G Number of tables rquiered to decompose R into BCNF is

R(A, B, C, D, E, F, G) Closure of (BC)* = BCEDAFG { BC } is a key of R Minimal cover of F is F' F'={ BC→ A, BC→ E, A→ F, F→ G, C→ D } Now decompose into BC ...

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

Byju's Answer

Consider a re...

Question

Consider a relation R(A, B, C, D, E, F, G) and set of functional dependencies F.

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

Number of tables rquiered to decompose R into BCNF is __________

Open in App

Solution

R(A, B, C, D, E, F, G)

Closure of (BC)* = BCEDAFG

${B C}$ is a key of R

Minimal cover of F is F'

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

Now decompose into BCNF,

$R_{1}$ (B, C, A, E), $R_{2}$ (A, F), $R_{3}$ (F,G), $R_{4}$ (C, D)

So total 4 tables required.

Suggest Corrections

Similar questions

Q. Consider the following relation R (A, B, C, D, E, F, G) and set of functional dependencies.

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

Which of the following is minimal cover of F?

Q. Consider a relation
R=ABCDEFG, FDs=BC

\to

E, A

\to

F, A

\to

G,
C

\to

D, F

\to

G, BC

\to

A.

What are tables after the BCNF decomposition?

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)?

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

F = (A C \to B, C \to D, A \to E, C \to B)

Relation R is decomposed into

R_{1} (A, B, C) a n d R_{2} (C, D)

then which of the following is correct about this 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 ________

Join BYJU'S Learning Program

Consider a relation R(A, B, C, D, E, F, G) and set of functional dependencies F. F={BCD→A,BC→E,A→F,F→G,C→D,A→G} Number of tables rquiered to decompose R into BCNF is __________

R(A, B, C, D, E, F, G) Closure of (BC)* = BCEDAFG {BC} is a key of R Minimal cover of F is F' F′={BC→A,BC→E,A→F,F→G,C→D} Now decompose into BCNF, R1(B, C, A, E), R2(A, F), R3(F,G), R4(C, D) So total 4 tables required.

Consider a relation R(A, B, C, D, E, F, G) and set of functional dependencies F.

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

Number of tables rquiered to decompose R into BCNF is __________

R(A, B, C, D, E, F, G)

Closure of (BC)* = BCEDAFG

${B C}$ is a key of R

Minimal cover of F is F'

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

Now decompose into BCNF,

$R_{1}$ (B, C, A, E), $R_{2}$ (A, F), $R_{3}$ (F,G), $R_{4}$ (C, D)

So total 4 tables required.