in Unknown Category reopened by
399 views
3 votes
3 votes
Consider the schema R = (S, T, U, V) and the dependencies S → T, T → U, U → V and V → S.

Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 = ϕ.

The decomposition is

A. not in 2NF

B. in 2NF but not 3NF

C. in 3NF but not in 2 NF

D. in both 2NF and 3NF
in Unknown Category reopened by
399 views

1 comment

edited by
no man,

question is not typed wrong

in this there is lossy decompostion

is it still in 2NF
–1
–1

2 Answers

0 votes
0 votes
here all the attributes are prime attributes....so no matter how we decompose from the condition R1 intersection as R2 as phi we get the relations with prime attributes...so they will be in 3NF ....so answer is D

1 comment

what about lossless join this is lossy

so is still it  in 2NF??
0
0
0 votes
0 votes
Here candidate keys are {S,T,U,V} in which  decompostion of relation will always be in 2nf because there will be no partial dependency also the relation will ne in3nf because every attribute is prime attribute so it is in 3nf.

Hence (d) option answer.

1 comment

this is lossy join
0
0

Related questions