A6 - 70(b Let S={AB,BCD,AD be a decomposition of R For each...

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

View Full Document Right Arrow Icon
University of Waterloo School of Computer Science CS348 Spring 2009 Assignment 6 Due: July 14, 2009 1. 30%(a) Let F = {AB C, A D, BD C, C A} be the set of fd’s on R(ABCD). Find all candidate keys of R. Explain your answer.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 70%(b) Let S={AB,BCD,AD} be a decomposition of R. For each relation scheme in S, find all projected fd’s. Is S in 3NF? Is S in BCNF? Is S a lossless decomposition? Is S dependency preserving? Explain your answers....
View Full Document

This note was uploaded on 10/23/2009 for the course CS 348 taught by Professor Woody during the Spring '09 term at Waterloo.

Ask a homework question - tutors are online