Let R(A,B,C) be a relation schema, and let R 1 (A,B) and R 2 (A,C) be a
Fantastic news! We've Found the answer you've been seeking!
Question:
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.
Related Book For
Fundamentals Of Database Systems
ISBN: 9780133970777
7th Edition
Authors: Ramez Elmasri, Shamkant Navathe
Posted Date: