Question: Let R be a relation schema with a set F of FDs. Prove that the decomposition of R into R1 and R2 is lossless-join if

Let R be a relation schema with a set F of FDs. Prove that the decomposition of R into R1 and R2 is lossless-join if and only if F+ contains R1 ∩ R2 → R1 or R1 ∩ R2 → R2.

Step by Step Solution

3.40 Rating (166 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

For both directions if and onlyif we use the notation C R 1 R 2 X R 1 C Y R 2 C so thatR 1 XC R 2 CY ... View full answer

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

Document Format (1 attachment)

Word file Icon

960-C-S-D (2502).docx

120 KBs Word File

Students Have Also Explored These Related Databases Questions!