Question: Consider the relation schema R = (N, Y, P, M, C) and assume that the following set of functional dependencies hold on R: F =
Consider the relation schema R = (N, Y, P, M, C) and assume that the following set of functional dependencies hold on R: F = { N M, NY P, M C}
Use the algorithm to find a lossless-join and dependency preserving decomposition of R into 3NF. Make sure to show all details.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
