For relation R = (L, M, N , O, P), the following dependencies hold: M → O NO →…

PYQ GATE 2002

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?

Attempted by 1 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…