Compiler-DesignOctober 11, 2023
UGC NET Dec 2004 paper-1October 11, 2023
For relation R = (L, M, N , O, P), the following dependencies hold:
M → O NO → P P → L and L → MN
R is decomposed into R1 = (L, M, N , P) and R2 = (M, O).
- (a) Is the above decomposition a lossless-join decomposition? Explain.
(b) Is the above decomposition dependency-preserving? If not, list all the dependencies that are not preserved.
(c) What is the highest normal form satisfied by the above decomposition?
Theory Explanation is given below.
Correct Answer: A