RelativeResourceManager - CS 6360- Database Design Fall 2010

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

View Full Document Right Arrow Icon
CS 6360- Database Design Fall 2010 Homework/Assignment# 2 Due: 11/29/2010-by 11.55 p.m. Related to Normalization: 1. Consider instances of relation R(A, B, C, D) shown in Figure 1. For each of the following sets of FDs, determine whether each of the instances is consistent with the FDs given: a. A → B,C B → D b. AB → C B → D c. AB → CD AC → B FIGURE 1 Instances of R(A, B, C, D) Instance 1 A B C D a1 b1 c1 d1 a2 b2 c1 d2 a3 b1 c2 d3 a4 b3 c2 d3 Instance 2 A B C D a1 b1 c1 d1 a2 b1 c2 d1 a3 b2 c1 d2 a4 b2 c2 d2 Instance 3 A B C D a1 b1 c1 d1 a2 b1 c2 d1 a1 b2 c3 d2 a2 b2 c4 d2
Background image of page 1

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

View Full DocumentRight Arrow Icon
2. Given the following set, S, of FDs: S = { A → B, B → C, AC → D} a. Find the closure of A, A . b. Is A a superkey? Explain. c. Is B a superkey? How do you know? d. Is the FD B → D in S ? How do you know? e. Find the closure of the set of FDs, S . 3. Examine each of the following sets of FDs and find any redundant FDs in each. Give a minimal cover for each. a.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/29/2010 for the course CS 6360 taught by Professor Sunanhan during the Spring '09 term at University of Texas at Dallas, Richardson.

Page1 / 3

RelativeResourceManager - CS 6360- Database Design Fall 2010

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

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