Question: Let R(A,B,C) be a relation schema, and let R 1 (A,B) and R 2 (A,C) be a decomposition of R. 1) Determine a set F

Let R(A,B,C) be a relation schema, and let R1(A,B) and R2(A,C) be a decomposition of R.

1) Determine a set F of non-trivial functional dependencies for R such that the decomposition of R in R1 and R2 is lossy and dependency-perserving. Explain why your selection of F is dependency-perserving.

2) Explain why your selection of F in the previous question is not a lossless decomposition.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!