Computer Sciences > GATE 2021 SET-1 > Normalization
Consider the relation R(P, Q, S, T, X, Y, Z, W) with the following functional dependencies.
PQ -> X, P -> YX, Q -> Y, Y -> ZW
Consider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes.
D1: R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)]
D2: R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)]
Which one of the following options is correct?
A
D1 is a lossless decomposition, but D2 is a lossy decomposition.
B
D1 is a lossy decomposition, but D2 is a lossless decomposition.
C
Both D1 and D2 are lossless decompositions.
D
Both D1 and D2 are lossy decompositions.

Correct : a

Similar Questions

A database of research articles in a journal uses the following schema. (VOLUME, NUMBER, STARTPGE, ENDPAGE, TITLE, YEAR, PRICE) The primary key is (VOLUME, NUM...
#128 MCQ
Consider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is TRUE ?
#275 MCQ
Given the following two statements: S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. S2: AB → C, D → E, E → C is...
#1201 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......