A3sol - Question 1[30 Marks a[5 Marks Explain why a...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Question 1 [30 Marks] a) [5 Marks] Explain why a relation with only two attributes is always in BCNF, regardless of functional dependencies. A : either a-> or b->a, one of the attribute must be the superkey, because it can determine every attribute in the table. If the only FD is a,b -> a or a,b -> b, then this FD is trivial. This relation is still in BCNF. b) [5 Marks] Explain why a relation with n attributes and only trivial functional dependencies is always in BCNF. A : All FDs are trivial. By definition it is in BCNF. c) [10 Marks] Consider the following database Relation R [a,b,c,d,e] with no duplicate records and with the following FDs: a,b -> c a -> d b -> e b -> d R is decomposed into the following tables: S [a, b, c] T [ b, e ] W [ b, d ] Is that a lossless decomposition of R? Why? [3 Marks] Is that a dependency preserving decomposition of R? Why? [3 Marks] Is that a BCNF decomposition? Why? [4 Marks] A : It is lossless decomposition. S intersect T = {b} -> T , S intersect W = {b} -> W, etc.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/28/2011 for the course CS 338 taught by Professor I.i during the Winter '09 term at Waterloo.

Page1 / 2

A3sol - Question 1[30 Marks a[5 Marks Explain why a...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online