The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged decomposition
0
votes
0
answers
1
Sel doubt
Relation R (A,B,C,D,E,F) Functional dependency: ABC >DEF, BC>EF, EF>D. Decomposition: R1 (ABCDF), R2 (BCDE). Is this decomposition lossy? Is this decomposition preserve functional dependency? Plz explain how to check functional dependency is preserved or not in decomposition.
asked
Dec 24, 2018
in
Databases
by
Raj Kumar 7
Active
(
1.1k
points)

136
views
databases
functionaldependencies
decomposition
+1
vote
1
answer
2
Self doubt dbms Normalisation
Is minimal set of functional dependency for a functional dependency set is always unique???
asked
Dec 10, 2018
in
Databases
by
gatecrack
(
279
points)

95
views
databases
decomposition
losslessjoin
databasenormalization
functionaldependencies
+1
vote
1
answer
3
Function Dependency question
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 3NF? if not, decompose to 3NF. //What does " with A as the only key" mean ?
asked
Jun 23, 2018
in
Databases
by
karthikmenon
(
15
points)

167
views
functionaldependencies
databasenormalization
database
decomposition
2nf
bcnfdecomposition
0
votes
1
answer
4
Self  Doubt : How to calculate candidate keys in decomposed Relation?
For relation R=(L, M, N, O, P), the following dependencies hold and R is decomposed into R1 = (L, M, N, P) and R2 = (M, O). How to calculate what candidate keys are there for relation R1 and R2. Please tell me the algorithm. FD's are $M\rightarrow O, NO\rightarrow P, P\rightarrow L, L\rightarrow MN$
asked
May 1, 2018
in
Databases
by
Durgesh Singh
Junior
(
755
points)

120
views
databases
databasenormalization
decomposition
+1
vote
1
answer
5
Lossless join
asked
Jan 12, 2018
in
Databases
by
Mk Utkarsh
Boss
(
35.8k
points)

108
views
databases
decomposition
losslessjoin
0
votes
0
answers
6
DBMS Losless join
R is divided into R1 and R2 ,but since there is no common attribute in R1 and R2, so it should form lossy join,as for loseless join the common attribute has to be key in one of the table.But here the image above,it is comming as loseless join.Can someone please check?
asked
Dec 12, 2017
in
Databases
by
rahul sharma 5
Boss
(
25.3k
points)

77
views
databases
naturaljoin
decomposition
losslessjoin
+1
vote
2
answers
7
lossless join
$R(X,Y,Z,W) is\ decomposed\ into \\ R_1(X,Y)\\ R_2(Y,Z)\\ R_3(Y,W).\\The\ FDs\ are\ :\\ X > Y,\\ Z>Y,\\ Y>W \\ Find\ whether\ the\ decomposition\ is\ lossless\ or\ lossy\ ?$
asked
Dec 8, 2017
in
Databases
by
Tuhin Dutta
Loyal
(
9.8k
points)

151
views
databases
decomposition
losslessjoin
+2
votes
1
answer
8
NORMALIZTION
Q.Let R (X, Y, Z, W) be a relational schema with the following functional dependencies: X→ Y, Y → Z, Z → W and W → Y. The decomposition of R into (X, Y), (Y, Z), (Y, W) it is asked to find whether it is lossless join and dependency preserving or not ? I am sure it is lossless join,but couldn't figure how it is dependency preserving.
asked
Dec 6, 2017
in
Databases
by
junaid ahmad
Loyal
(
8.5k
points)

144
views
decomposition
0
votes
2
answers
9
2NF decomposition
How is it option D??
asked
Nov 20, 2017
in
Databases
by
Parshu gate
Active
(
3.1k
points)

832
views
databasenormalization
functionaldependencies
2nf
databases
decomposition
+1
vote
2
answers
10
virtual gate
Relation R(ABCDEF) with the following set of functional dependencies {AB→CDEF, C→A, D→B, E→F, B→E}. The decomposed relationslations of R into 3NF are __________________________.
asked
Nov 14, 2017
in
Databases
by
Manoja Rajalakshmi A
Boss
(
11.5k
points)

166
views
decomposition
3nfdecomposition
+2
votes
2
answers
11
lossless decomposition
I know the condition for a 2 table to be lossless, but i cannot visualize it. How is 1 table which is decomposed, and if common attribute is key in any one of table, then its lossless decomposition. Can anyone explain me this with different analogy or help me visualize it.
asked
Sep 30, 2017
in
Databases
by
Aman Bisht 1
Junior
(
549
points)

223
views
decomposition
0
votes
2
answers
12
DBMSDecomposition
Which of the following statement is true while decomposition ? 3NF guaranteed dependency preserving 3NF guaranteed lossless property Both of the above None of the above
asked
Sep 21, 2017
in
Databases
by
rishu_darkshadow
Loyal
(
7.2k
points)

128
views
decomposition
databases
0
votes
1
answer
13
Testing Lossless join
State true or false: Symbol " ^ " stands for an intersection AND letters in bold are the candidate key of the respective table. 1) R1(A, B, C) ^ R2(B, C) = {B,C} IS LOSSLESS JOIN. 2) R1(A, B, C) ^ R2(B, D) = {B} IS LOSSY JOIN. 3) R1(A, B ... C), R2(D, E), R3(F, B), R4(D, G, A) Also, tell what will be the candidate key after performing join each time and at the end.
asked
May 3, 2017
in
Databases
by
Shubhanshu
Boss
(
18.2k
points)

149
views
databases
decomposition
losslessjoin
+8
votes
2
answers
14
Higher normal form decomposition
$X$ is an entity set. $E$ and $F$ are multivalued attributes. How many minimum tables which satisfy 1NF ? How many minimum tables which satisfy 2NF ? How many minimum tables which satisfy 3NF ? How many minimum tables which satisfy BCNF ? How many minimum tables which satisfy 4NF ?
asked
Feb 1, 2017
in
Databases
by
dd
Veteran
(
57k
points)

798
views
databasenormalization
databases
decomposition
erdiagram
+2
votes
2
answers
15
DBMS Normalisation
Consider a schema R(A, B, C, D) and functional dependencies {AB → C, C → D, D→ A}. Then the decomposition of R into R1 (CD), R2 (AC) and R3 (BC) is in a. 1NF but not 2NF b. 2NF but not 3NF c. 3NF but not BCNF d. BCNF
asked
Jan 12, 2017
in
Databases
by
sanyam53
(
317
points)

233
views
databases
decomposition
databasenormalization
+2
votes
4
answers
16
DBMSNormalisationLossless Join Decomposition
asked
Dec 21, 2016
in
Databases
by
KISHALAY DAS
Active
(
4.9k
points)

352
views
databases
decomposition
functionaldependencies
losslessjoin
+1
vote
1
answer
17
Lossy join decomposition
asked
Dec 9, 2016
in
Databases
by
Rakesh K
Active
(
1.8k
points)

610
views
databases
databasenormalization
decomposition
0
votes
1
answer
18
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)
asked
Nov 3, 2016
in
Databases
by
Chetnawadhwa
(
459
points)

152
views
databases
losslessjoin
dependencypreserving
functionaldependencies
decomposition
+1
vote
1
answer
19
UGCNETAUG2016III10
Consider the table $R$ with attributes $A, B$ and $C$. The functional dependencies that hold on $R$ are : $A \rightarrow B, C \rightarrow AB$. Which of the following statements is/are True ? I. The decomposition of $R$ into $R1(C, A)$ and $R2(A, B)$ is lossless. II. The ... $R1(A, B)$ and $R2(B, C)$ is lossy. Only $I$ Only $II$ Both $I$ and $II$ Neither $I$ nor $II$
asked
Sep 30, 2016
in
Databases
by
makhdoom ghaya
Boss
(
30.2k
points)

432
views
ugcnetaug2016iii
databases
functionaldependencies
decomposition
+4
votes
1
answer
20
Checking for losslessjoin property
The decomposition of relation R with FD set F into R1 and R2 has lossless join property iff R1 $\cap$ R2 $\rightarrow$ R1 $\in$ F$^+$ OR R1 $\cap$ R2 $\rightarrow$ R2 $\in$ F$^+$ If R is decomposed into more than 2 ... ? Or is that table drawing thing the only way to check for lossless join property ? Answers with reference(s) will be much appreciated. Thanks.
asked
Sep 22, 2016
in
Databases
by
Rounak Agarwal
(
439
points)

559
views
decomposition
databases
losslessjoin
+2
votes
3
answers
21
UGCNETJune2011II20
Decomposition help in eliminating some of the problems of bad design Redundancy Inconsistencies Anomalies All of the above
asked
Aug 24, 2016
in
Others
by
makhdoom ghaya
Boss
(
30.2k
points)

363
views
ugcnetjune2011ii
database
decomposition
+3
votes
1
answer
22
UGCNETJune2015III11
The relation schemas $R_1$ and $R_2$ form a Lossless join decomposition of $R$ if and only if $R_1 \cap R_2 \twoheadrightarrow (R_1R_2)$ $R_1 \rightarrow R_2$ $R_1 \cap R_2 \twoheadrightarrow (R_2R_1)$ $R_2 \rightarrow R_1 \cap R_2$ a and b happen a and d happen a and c happen b and c happen
asked
Jul 31, 2016
in
Databases
by
jothee
Veteran
(
105k
points)

816
views
ugcnetjune2015iii
databases
decomposition
databasenormalization
+1
vote
2
answers
23
UGCNETDec2012III56
If a relation with a Schema R is decomposed into two relations $R_1$ and $R_2$ such that $(R_1 \cup R_2) = R_1$ then which one of the following is to be satisfied for a lossless joint decomposition ($\rightarrow$ ... $R_1 \cap R_2 \rightarrow R_2$ $(R_1 \cap R_2) \rightarrow R_1 \text{ and } R_1 \cap R_2 \rightarrow R_2$
asked
Jul 13, 2016
in
Databases
by
jothee
Veteran
(
105k
points)

632
views
ugcnetdec2012iii
databases
decomposition
+1
vote
4
answers
24
Canonical cover of a set
Consider the following set of functional dependency on the scheme (A, B,C) A>BC, B>C, A> B, AB>C The canonical cover for this set is: (A) A>BC and B> C B. A>BC and AB> C C. A> BC and A> B D. A> B and B> C
asked
Jan 24, 2016
in
Databases
by
Purple
Active
(
3k
points)

804
views
functionaldependencies
databases
canonicalcover
decomposition
0
votes
3
answers
25
Which of the above decomposition has/ have lossless join property?
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, ... decomposition (s) has/ have lossless join property? A. Only D1 B. Only D2 C. Both D1 and D2 D. Neither D1 nor D2
asked
Jan 24, 2016
in
Databases
by
Purple
Active
(
3k
points)

644
views
databases
functionaldependencies
dependencypreserving
decomposition
+2
votes
2
answers
26
For which of the following set of functional dependencies does the relation R(A,B,C,D) has AB,CD as closed sets
asked
Dec 25, 2015
in
Databases
by
shiva
(
279
points)

484
views
functionaldependencies
decomposition
0
votes
2
answers
27
how to approach this type of question
i know how to find whether the decomposition is lossless or lossy . but in this type of question they are actually not defining how they decompose . they are only giving a set of functional depenencies . how to solve this type of question
asked
Aug 22, 2015
in
Databases
by
Tendua
Boss
(
16k
points)

109
views
databases
decomposition
+2
votes
3
answers
28
Find minimal cover from given functional dependencies
A > BC CD> E B>D E>A
asked
Jun 12, 2015
in
Databases
by
gauravalgo
(
99
points)

3.2k
views
functionaldependencies
decomposition
+1
vote
3
answers
29
Given a relation R(A, B, C) with functional dependencies set {A → B, B → C, C → B}
asked
Jan 7, 2015
in
Databases
by
Keith Kr
Loyal
(
5.9k
points)

948
views
functionaldependencies
decomposition
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
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
Recent Posts
ECIL Interview Experience
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged decomposition
Recent Blog Comments
Not really. It was excluding shipping I guess....
Ok sir. Actually pricing on Flipkart is 200 less...
NO.
Is this application open for 2020 graduates i.e....
@Ayush Upadhyaya sir any approximate idea...
50,645
questions
56,601
answers
195,856
comments
102,230
users