

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Assignment; Professor: Ray; Class: Database Systems; Subject: Computer Science; University: Colorado State University; Term: Spring 2009;
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Question 1-7 and 9: 10 points/each. Question 8 a) and b): 5 points/each. Question 8 c) and d): 10 points/each.
(b) Let F = {A โ C, AB โ C, C โ DI, EC โ AB, EI โ C}. We need to obtain an equivalent set of FDs that satisfies the three properties od a minimal cover.
(b) IS is the only candidate key since neither I nor S appear in the right hand side if any FD. Therefore any candidate key will have to contain both I and S. But since IS forms a candidate key, it is the only candidate key. (c) One possible decomposition is obtained as follows: (d) We first find the minimal cover F = {S โ D, I โ B, IS โ Q, B โ O}. It turns that F is minimal. Thus {SD, IB, ISQ, BO} is required decom- position. Notice ISQ โ BOISQD, hence the decomposition has lossless property.
(a) Since EP is the only candiddate key of R, both E and P are prime attributes while T and B are nonprime attributes.