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
Step: 1
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Authors: Ramez Elmasri, Shamkant Navathe
7th Edition
0133970779, 978-0133970777
