Dark Mode

Recent questions tagged dependency-preserving

2 votes

1 answer

1

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})$ and the functional dependency set $\mathrm{F}$ that holds on $\mathrm{R}:$ ... . Decomposition is dependency preserving. $\text{P}$ is in $3 \mathrm{NF}$. $\mathrm{S}$ is in $3 \mathrm{NF}$.

GO Classes asked in Databases Mar 26, 2023

661 views

0 votes

1 answer

2

#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.

Abhishek tarpara asked in Databases Sep 17, 2021

by Abhishek tarpara

892 views

3 votes

4 answers

3

NIELIT 2016 MAR Scientist C - Section C: 3
Every Boyce-Codd Normal Form (BCNF) decomposition is dependency preserving not dependency preserving need be dependency preserving none of these

admin asked in Databases Apr 2, 2020

by admin

2.4k views

0 votes

4 answers

4

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$ into $R_{1} \left (MN \right )$ and $R_{2} \left (PQ \right )$ ... but not lossless join Dependency preserving and lossless join Lossless join but not dependency preserving Neither dependency preserving nor lossless join.

go_editor asked in Databases Mar 24, 2020

2.2k views

1 vote

3 answers

5

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->C A->B,B->C,C->A AB->C,C->A None of these

ushamya asked in Databases Jun 3, 2019

923 views

1 vote

1 answer

6

made easy test series - lossless join and dependency preserving
How is A answer?

amitqy asked in Databases Apr 7, 2019

by amitqy

1.0k views

0 votes

0 answers

7

dependency preservation
Consider a relation R= {M, N, O,P, Q, R, S, T} with the following set of dependencies: MN -> Q M -> RQ N -> R R -> ST Next consider the following set of decompositions for the relation schema R: D1= {R1,R2,R3,R4}: R1={M,N,O,P} ... ,T} Which of the above decomposition (1) has/ have lossless join property? A. Only D1 B. Only D2 C.Both D1 and D2 D. Neither D1 nor D2

OneZero asked in Databases Dec 19, 2018

516 views

0 votes

2 answers

8

NIELIT 2018-63
Identify the true statement from the given statements. Lossless, dependency-preserving Decompositoin into $3$ NF is always possible Any relation with two attributes is BCNF $1$ $2$ $1$ and $2$ None of these

Arjun asked in Databases Dec 7, 2018

by Arjun

1.4k views

1 vote

1 answer

9

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 $BCNF$ is $3NF$ and vice versa $?$ $(b)FD$ preserving or not$?$ $(c)$ Lossless decomposition or lossy decomposition?

Lakshman Bhaiya asked in Databases Nov 20, 2018

by Lakshman Bhaiya

2.1k views

6 votes

2 answers

10

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 decompositions is Lossless Decomposition Dependency Preserving Which of the ... 1 is TRUE but 2 is FALSE B) 1 is FALSE but 2 is TRUE C) Both 1 and 2 are TRUE D) Both 1 and 2 are FALSE

Balaji Jegan asked in Databases Sep 26, 2018

by Balaji Jegan

2.2k views

0 votes

1 answer

11

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

night_fury asked in Databases Sep 23, 2018

756 views

1 vote

2 answers

12

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?

Balaji Jegan asked in Databases Jul 9, 2018

by Balaji Jegan

731 views

3 votes

1 answer

13

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,D).We cannot do R1(A,B,C) and R2(C,A,D) because the Production C-> ... R1 intersection R3 as well ? because if we do then it wont be lossless as there isn't any common attribute. Please tell the right way to check.

Na462 asked in Databases Apr 22, 2018

by Na462

1.1k views

3 votes

1 answer

14

Dependency preserving decompostion
A relation $R(ABCD)$ is given FD 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.....

Shubham Sharma 2 asked in Databases Mar 25, 2018

by Shubham Sharma 2

433 views

3 votes

1 answer

15

Gateforum Test series

Mk Utkarsh asked in Databases Jan 12, 2018

466 views

6 votes

2 answers

16

BCNF, lossless, functional dependency preserving.
Given R(ABCDEFG) and functional dependencies AB $\rightarrow$ C BC $\rightarrow$ A AC $\rightarrow$ B B $\rightarrow$ D D $\rightarrow$ E Decompositions: 1. R1(ABC) R2(ABFG) R3(BD) R4(DE) 2. R1(ABC) R2(BCFG) R3(BD) ... ABC) R2(ACFG) R3(BD) R4(DE) Is all of these decompositions are lossless, dependency persevering and BCNF? Please confirm. Thank you.

Hemant Parihar asked in Databases Jan 7, 2018

by Hemant Parihar

2.3k views

3 votes

1 answer

17

lossless and dependency preserving
Consider a relation R(A, B, C, D, E, F, G) with set of functional dependencies F = {AD → BF, CD → EGC, BD → F, E → D, F → C, D → F} The relation R is decomposed into the following two ... (B) Decomposition is lossy and dependency preserving (C) Decomposition is lossy and not dependency preserving (D) Decomposition is lossless and not dependency preserving

Parshu gate asked in Databases Nov 11, 2017

1.7k views

2 votes

3 answers

18

can any one tell what are the steps to find whether there is Dependency Preserving Decomposition or not?

hem chandra joshi asked in Databases Aug 25, 2017

by hem chandra joshi

1.9k views

1 vote

2 answers

19

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 decomposition of R into (A, B), (B, C), (B, D) gives a lossless join, and is dependency ... join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving

set2018 asked in Databases Jul 25, 2017

2.1k views

1 vote

0 answers

20

help and doubt
can anyone please teach me how to find where a functional dependencies are dapendencies preserving or not with examples?

Palash Moon asked in Databases Jul 25, 2017

254 views

0 votes

1 answer

21

BCNF and Dependency preserving

vaishali jhalani asked in Databases Jan 25, 2017

by vaishali jhalani

838 views

1 vote

1 answer

22

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/

Anup patel asked in Databases Jan 25, 2017

612 views

1 vote

3 answers

23

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?

sh!va asked in Databases Jan 23, 2017

by sh!va

451 views

2 votes

2 answers

24

dependancy preserving dbms

Anmol Verma asked in Databases Nov 23, 2016

428 views

5 votes

1 answer

25

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 that Decomposition is lossless-join ,dependency-preserving and in BCNF normal form ??

saurabh rai asked in Databases Nov 6, 2016

1.4k views

0 votes

1 answer

26

Database mgmt system
Tell whether the following decomposition of relations lossless and dependency preserving or not. 1. R(ABCDEFGHIJ) and FD sets AB->C, A->DE, B->F, F->GH, D->IJ a) D1"={ DIJ, ACE, FGH, BF, ADC} b) D2={ FGH, DIJ, ADEBF, ABC} 2.R(ABCDEG) and FD sets AB->C, AC->B, AD->E, B->D, BC->A, E->G a) D=( ABC, ACDE, ADG)

Chetnawadhwa asked in Databases Nov 2, 2016

by Chetnawadhwa

1.5k views

5 votes

3 answers

27

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$ and $W\rightarrow Y$ The decomposition of R into (X,Y),(Y,Z),(Y,W) is a. ... preserving b. Lossless join, but is not dependency preserving c. Lossless join and dependency preserving d. Lossy join and not dependency preserving

GateAspirant999 asked in Databases Oct 29, 2016

by GateAspirant999

2.8k views

Page:

Recent questions tagged dependency-preserving