Consider the following relational schema F(PQRST) with functional…
Consider the following relational schema F(PQRST) with functional dependencies:
{PQ→R, S->T, T->P, S-> Q);
The number of additional relations are required to convert it into lossless join & Dependency preserving
2NF Decomposition is ?
Answer: 0 — R(PQRST) (PQ, R-S, S-T, T→P, S->Q; Candidate key = [S] Prime attribute = {S} There is no partial dependency as the CK is a simple CK hence the relation is…
Attempted by 19 students.
Show answer & explanation
Correct answer: 0
R(PQRST) (PQ, R-S, S-T, T→P, S->Q;
Candidate key = [S]
Prime attribute = {S}
There is no partial dependency as the CK is a simple CK hence the relation is already in 2NF
So, '0' (No more) additional relation required to decompose into 2NF.
Loading lesson…