Register

Recent questions tagged dependency-preserving

1.1k
views
1 answers
2 votes
GO Classes 2023 | IIITH Mock Test 1 | Question: 46
Consider a relation schema $\mathrm{R}$ with attributes $(\mathrm{X}, \mathrm{Y}, \mathrm{Z}, \mathrm{U}, \mathrm{V}, \mathrm{W})$ ... $3 \mathrm{NF}$.$\mathrm{S}$ is in $3 \mathrm{NF}$.
User Avatar
993
views
1 answers
0 votes
#DBMS #dependency
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.
User Avatar
2.5k
views
4 answers
3 votes
NIELIT 2016 MAR Scientist C - Section C: 3
Every Boyce-Codd Normal Form (BCNF) decomposition isdependency preservingnot dependency preservingneed be dependency preservingnone of these
User Avatar
2.5k
views
4 answers
0 votes
UGC NET CSE | January 2017 | Part 2 | Question: 19
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ ... and lossless joinLossless join but not dependency preservingNeither dependency preserving nor lossless join.
User Avatar
972
views
3 answers
1 votes
ACE Test Series : dependency preserving
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
User Avatar
1.1k
views
1 answers
1 votes
made easy test series - lossless join and dependency preserving
How is A answer?
User Avatar
568
views
0 answers
0 votes
dependency preservation
Consider a relation R= {M, N, O,P, Q, R, S, T} with the following set of dependencies:MN -> QM -> RQN -> RR -> STNext consider the following set of decompositions for the ... C.Both D1 and D2 D. Neither D1 nor D2
User Avatar
1.6k
views
2 answers
0 votes
NIELIT 2018-63
Identify the true statement from the given statements.Lossless, dependency-preserving Decompositoin into $3$ NF is always possibleAny relation with two attributes is BCNF$1$2$1$ and $2$None of these
User Avatar
2.3k
views
1 answers
1 votes
Functional preserving
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 $ ... vice versa $?$(b)FD$ preserving or not$?$(c)$ Lossless decomposition or lossy decomposition?
User Avatar
2.4k
views
2 answers
6 votes
Lossless Decomposition and Dependency Preservation
Consider R(A,B,C,D,E)with the FD Set F(A->B, A->C, DE->C, DE->B, C->D)Consider this decomposition : R1(A,B,C), R2(B,C,D,E) and R3(A,E)Then, the ... but 2 is FALSEB) 1 is FALSE but 2 is TRUEC) Both 1 and 2 are TRUED) Both 1 and 2 are FALSE
User Avatar
819
views
1 answers
0 votes
lossless and dependency preserving decomposition #testseries
The below decomposition is lossless or lossy and also dependency preserving or not?
User Avatar
778
views
2 answers
1 votes
Lossless Join and Dependency Preservation
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?
User Avatar
1.2k
views
1 answers
3 votes
Dependency Preservation
Doubts : -1. R(A,B,C,D) and The Functional Dependencies are = AB->C, C->AD . So when I'll decompose it then it will be R1(A,B,C) and R2(C ... then it wont be lossless as there isn't any common attribute.Please tell the right way to check.
User Avatar
461
views
1 answers
3 votes
Dependency preserving decompostion
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.....
User Avatar
533
views
1 answers
3 votes
Gateforum Test series
User Avatar
2.5k
views
2 answers
6 votes
BCNF, lossless, functional dependency preserving.
Given R(ABCDEFG) and functional dependenciesAB $\rightarrow$ CBC $\rightarrow$ AAC $\rightarrow$ BB $\rightarrow$ DD $\rightarrow$ EDecompositions:1 ... decompositions are lossless, dependency persevering and BCNF?Please confirm. Thank you.
User Avatar
1.8k
views
1 answers
3 votes
lossless and dependency preserving
Consider a relation R(A, B, C, D, E, F, G) with set of functional dependenciesF = {AD → BF, CD → EGC, BD → F, E → D, ... (C) Decomposition is lossy and not dependency preserving(D) Decomposition is lossless and not dependency preserving
User Avatar
2.0k
views
3 answers
2 votes
can any one tell what are the steps to find whether there is Dependency Preserving Decomposition or not?
User Avatar
2.3k
views
2 answers
1 votes
dependency preserving
Let R (A, B, C, D) be a relational schema with the following functional dependencies : A → B, B → C, C → D and D → B. The ... a lossless join, but is dependency preservingdoes not give a lossless join and is not dependency preserving
User Avatar
292
views
0 answers
1 votes
help and doubt
can anyone please teach me how to find where a functional dependencies are dapendencies preserving or not with examples?
User Avatar
929
views
1 answers
0 votes
BCNF and Dependency preserving
User Avatar
720
views
1 answers
1 votes
Dependency Preserving or Not ?
R(ABCD)F={ A→B, B→C, C→D, D→A }Now Decompose this into D={ AB, BC, CD }Dependency is preserved or Not ?Source : http://www.gatecrack.in/following-decomposition-dependency-preserving-not/
User Avatar
500
views
3 answers
1 votes
Is the decomposition preserving dependencies?
a relational schema R (A, B, C, D) is decomposed into (A, B), (B, C), (B, D). If functional dependencies A → B, B → C, C → D and D → B were present in R, is the decomposition preserving dependencies?
User Avatar
473
views
2 answers
2 votes
dependancy preserving dbms
User Avatar
1.4k
views
1 answers
5 votes
decomposition
For givem relation R(A,B,C,D,E)F:{B ->D,CD ->E,E->A,A->BC}Is it possible 2 decompose R into two relations R1and R2 such thatDecomposition is lossless-join ,dependency-preserving and in BCNF normal form ??
User Avatar
1.7k
views
1 answers
0 votes
Database mgmt system
Tell whether the following decomposition of relations lossless and dependency preserving or not.1. R(ABCDEFGHIJ) and FD setsAB->C, A->DE, B->F, F->GH, D->IJa) D1"={ DIJ, ACE, FGH, ... ->B, AD->E, B->D, BC->A, E->Ga) D=( ABC, ACDE, ADG)
User Avatar
3.1k
views
3 answers
5 votes
Dependency preserving decomposition
Let R(X,Y,Z,W) be a relational schema with the following functional dependencies:$X\rightarrow Y, Y\rightarrow Z, Z\rightarrow W$ ... preservingc. Lossless join and dependency preservingd. Lossy join and not dependency preserving
User Avatar
Page: