Search results for dependency-preserving / GATE Overflow for GATE CSE

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}$.

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 $\mat...

GO Classes

794 views

GO Classes asked Mar 26, 2023

0 votes

1 answer

2

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

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

night_fury

763 views

night_fury asked Sep 23, 2018

0 votes

1 answer

3

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

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

919 views

Abhishek tarpara asked Sep 17, 2021

3 votes

4 answers

4

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

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

admin

2.4k views

admin asked Apr 2, 2020

2 votes

1 answer

5

GATE Overflow Test Series | Mock GATE | Test 4 | Question: 42
Let $R (A, B, C,D,E,G)$ ... preserving. does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving.

Let $R (A, B, C,D,E,G)$ be a relational schema with the following functional dependencies:$\{AB \rightarrow C, AC \rightarrow B, AD \rightarrow E,B \rightarrow D, BC \rig...

gatecse

296 views

gatecse asked Feb 1, 2021

2 votes

2 answers

6

dependancy preserving dbms

Anmol Verma

436 views

Anmol Verma asked Nov 23, 2016

0 votes

4 answers

7

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.

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

go_editor

2.3k views

go_editor asked Mar 24, 2020

1 votes

3 answers

8

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

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

ushamya

921 views

ushamya asked Jun 3, 2019

0 votes

2 answers

9

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

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

Arjun

1.5k views

Arjun asked Dec 7, 2018

1 votes

1 answer

10

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

How is A answer?

amitqy

1.0k views

amitqy asked Apr 7, 2019

6 votes

2 answers

11

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

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

Balaji Jegan

2.3k views

Balaji Jegan asked Sep 26, 2018

2 votes

2 answers

12

Virtual Gate Test Series:Databases-Normalization-Functional dependency
A relation $R(ABCDEFGHIJ)$ with functional dependency set $F={AB\rightarrow C , A\rightarrow DE , B\rightarrow F , F\rightarrow GH, D\rightarrow I J}$ , and the decomposition of $R$ ... $1.$lossless $2.$lossy $3.$Not dependency preserving $4.$Dependency preserving

A relation $R(ABCDEFGHIJ)$ with functional dependency set$F={AB\rightarrow C , A\rightarrow DE , B\rightarrow F , F\rightarrow GH, D\rightarrow I J}$ , and the decomposit...

Turning Turing

730 views

Turning Turing asked Sep 25, 2016

3 votes

1 answer

13

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

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

Parshu gate

1.7k views

Parshu gate asked Nov 11, 2017

1 votes

1 answer

14

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?

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

Lakshman Bhaiya

2.1k views

Lakshman Bhaiya asked Nov 20, 2018

0 votes

0 answers

15

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

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

OneZero

530 views

OneZero asked Dec 19, 2018

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.

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

Hemant Parihar

2.3k views

Hemant Parihar asked Jan 7, 2018

1 votes

2 answers

17

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?

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

733 views

Balaji Jegan asked Jul 9, 2018

3 votes

1 answer

18

Gateforum Test series

Mk Utkarsh

480 views

Mk Utkarsh asked Jan 12, 2018

3 votes

1 answer

19

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.

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

Na462

1.1k views

Na462 asked Apr 22, 2018

3 votes

1 answer

20

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

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

Shubham Sharma 2

430 views

Shubham Sharma 2 asked Mar 25, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true