INFO210_HW4_solution

Clearly mark all keys in the intermediate and final

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: te BCNF in any case. Problem 3 (20pts) Consider relation R: ABCDEFG, with key A. (a) Suppose that the following FDs hold on R: C- > DE and BF - >G. Decompose R into BCNF. Clearly state which FD is processed at each step, and show all intermediate relations. Clearly mark all keys in the intermediate and final relations. Solution: First, we observe that both FDs violate BCNF, and we can consider them in any order. Two decompositions are possible, depending on which FD is applied first. Both are shown below, one is enough for a correct solution. Keys are underlined at each step. Both solutions have the same result: a dec...
View Full Document

This note was uploaded on 01/21/2014 for the course INFO 210 taught by Professor Stoy during the Winter '13 term at Drexel.

Ask a homework question - tutors are online