Recent questions tagged bcnf-decomposition

Which statement correctly describes the guarantee of the standard BCNF decomposition procedure?Every relation has a decomposition that is simultaneously BCNF, lossless an...

Consider $R(A,B,C,D,E,F)$ with $F=\{A\to B,\ A\to C,\ BC\to E,\ BC\to D,\ E\to F,\ BC\to F\}$.Suppose the following BCNF decomposition is used:$R_1(B,C,E)$$R_2(B,C,F)$$R_...

Consider $\text{GSL}(D,M,N_1,N_2,G_1,G_2,C_1,C_2,E,R)$, where $M$ is the primary key, together with$M\to D,$$E\to R,$$N_1\to G_1C_1,$$N_2\to G_2C_2,$$G_1C_1\to N_1,$$G_2C...

Consider $R(A,B,C,D,E)$ with $F=\{AB\to C,\ BC\to D,\ CD\to E,\ DE\to A\}$.Suppose the BCNF decomposition begins with the violating FD $:CD\to E$.Which set of relations i...

Consider $R(A,B,C,D,E)$ with $F=\{D\to B,\ DE\to A,\ C\to AD\}$.Which of the following is a valid BCNF decomposition of $R$?$\{DB,\ ADE,\ CE\}$ $\{CDA,\ DEB\}$ $\{DB,\ AC...

Consider $R(I,N,W,S,Q,T,P,R)$ with $F=\{N\to W,\ IN\to S\}$.Which of the following is the BCNF decomposition produced by successively removing these violations?$R_1(N,W)$...

Consider $R(A,B,C,D)$ with $F=\{A\to B,\ C\to D\}$. Which of the following is a correct BCNF decomposition of $R$?$R_1(A,B)$$R_2(C,D)$$R_3(A,C)$ $R_1(A,B,C)$$R_2(C,D)$ $R...

Consider a relation R(ABCD) where {AB - CD, D - A}. Check for BCNF, and if found to be violating it's conditions, decompose and tell the candidate keys for each table.

$(A)1$ $(B)2$ $(C)4\\$ $(D)\ 5$

Which one of the following statements about normal forms is FALSE?BCNF is stricter than $3$NF.Lossless, dependency-preserving decomposition into BCNF is always possible.L...

Which one of the following statements are not correct?$S1$: $3$NF decomposition is always lossless join and dependency preserving.$S2$: $3$NF decomposition is always loss...

R(A,B,C) is a relation.Which of the following don't have dependency preserving BCNF decomposition?A->B, B->CA->B,B->C,C->AAB->C,C->ANone of these

Decompose into BCNFR(A, B, C, D, E)FD: AB->C, C->D, D>B, D->E

R(A, B, C, D)FD: B->C, D->Ais the following decomposition in BCNF?R1(B, C), R2(A, D), R3(C, D)

Consider a relation R(A,B,C,D,E,F,H) with A as the only key. Assume that the dependencies E->F and C- DEH hold.on R.1. Is R in 2NF? If not, decompose to 2NF.2. is R in 3N...

Given: The Relation R(A,B,C,D,E) having (A,B) as Primary key. The set of functional dependencies: (A,C) >D , (B,D) >E. I want to Know whether the functional dependencies ...

I am getting 3 tables as R1(ABD) , R2(CE) and R3(AC). Is it correct?

Relation: R(ABCDE):FDs: A->BC, CD->E, B->D, E->AThis relation is not in BCNF bcz of FD B->D. So how it make BCNF by decomposition so that the resultant decomposition is b...

Consider the following relation: R (ABCDEF) F = {AB → C, BC → A, AC → ...