Back to the 2024 paper

Module 2: Relational Query Languages & Design

20247m

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)]
Identify whether it is a lossless or lossy decomposition and justify your answer.

Similar questions

Budget AppAndroid App

Pocketly on Android

Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.