Recent questions tagged dependency-preserving

Consider $R(S,N,C,P,X,Y,Q)$ with $F=\{S\to NC,\ P\to XY,\ SP\to Q\}$.The relation is decomposed into $R_1(S,N,C),$ $R_2(P,X,Y), $ $R_3(S,P,Q)$.Which statement is correct?...

Consider $R(A,B,C,D,E)$ with $F=\{A\to DE,\ BE\to C,\ D\to B,\ C\to A\}$.The relation is decomposed into $R_1(A,B,C)$ and $R_2(A,D,E)$.Which of the following statements a...

Consider $R(A,B,C,D)$ with $F=\{B\to C,\ D\to A\}$.The relation is decomposed into $R_1(B,C)$ and $R_2(A,D)$.Which of the following statements are correct?The decompositi...

Consider $X(A,B,C,D,E,F)$ with $F=\{AB\to CD,\ CD\to EF\}$.The relation is decomposed into $X_1(A,B,C,D)$ and $X_2(C,D,E,F)$.Which statement is correct?The decomposition ...

Let $R$ be a relation schema with a set of functional dependencies $F$.The relation $R$ is decomposed into $n$ relation schemas$R_1, R_2, \ldots, R_n$.Consider the follow...

Consider a schema $\text{R(P, Q, R, S)}$ and the following functional dependencies $\text{P} \rightarrow \text{Q}, \text{Q} \rightarrow \text{R}, \text{R} \rightarrow \te...

Which of the following relations can not be decomposed in to BCNF with a lossless join and dependency-preserving decomposition?$\mathrm{R}(\mathrm{V}, \mathrm{W}, \mathrm...

Which of the following is a characteristic of Boyce-Codd Normal Form $\text{(BCNF)}?$Every determinant is a candidate keyThere are no transitive dependenciesThere are no ...

What is the number of redundent FD’s possible for given set of FD , A->B, B->C,C->D for relation R(ABCD)?? please explain in detail.

Every Boyce-Codd Normal Form (BCNF) decomposition isdependency preservingnot dependency preservingneed be dependency preservingnone of these

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

Identify the true statement from the given statements.Lossless, dependency-preserving Decompositoin into $3$ NF is always possibleAny relation with two attributes is BCNF...

Given $R(A,B,C,D,E)$ and $F:\left \{A\rightarrow BC ,CD\rightarrow E,B\rightarrow D,E\rightarrow A\right \}$,Decompose into $BCNF?$$(a)$Every $BCNF$ is $3NF$ and vice ver...

The below decomposition is lossless or lossy and also dependency preserving or not?

Consider R(B->D, C->B, D->A)Consider the following 2 decompositions : R1(ABC) and R2(CD).Whether this is a lossless decomposition?Whether this is a lossless decomposition...

A relation $R(ABCD)$ is givenFD set = $\{ AB\rightarrow CD , D\rightarrow A \}$R1(ABC)R2(AD)R3(BCD)Test Dependencies in R1, R2 ,R3 ? Pls explain the solution in detail.....

Given R(ABCDEFG) and functional dependenciesAB $\rightarrow$ CBC $\rightarrow$ AAC $\rightarrow$ BB $\rightarrow$ DD $\rightarrow$ EDecompositions:1. R1(ABC) R2(ABFG) R3...

Consider a relation R(A, B, C, D, E, F, G) with set of functional dependenciesF = {AD → BF, CD → EGC, BD → F, E → D, F → C, D → F}The relation R is decomposed into the fo...