CS348 Lecture : Assignment #2 Winter 2010

63 views2 pages

Document Summary

Assignment 2 (due monday, april 5 at 5:00 pm) Using armstrong"s axioms plus union and decomposition, prove the following: Given attribute sets w, x, y, and z, if wx. Prove that cdg is a candidate key for r. Let r be a relational schema with attributes {a, b, c, d, e, g} and let f be the set of functional dependencies f = {cd. B}. (a) (5 marks) decompose r (losslessly) into a bcnf database schema. Show your answer as a decomposition tree as follows: relation r should appear at the root of the tree. If one decomposition step decomposes relation s into relations t and u using a functional dependency x be labeled with x. Y to indicate the dependency that was used to decompose it. Let r be a relational schema with attributes {a, b, c, d, e } and let f be the set of functional dependencies f = {ab.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions