COMP 3380 Lecture Notes - Lecture 4: Candidate Key, Second Normal Form, Superkey

• School: University of Manitoba
• Department: Computer Science
• Course: COMP 3380
• Professor: Adam G.Pazdor

Document Summary

Instructors: dr. carson k. leung & adam pazdor. What are the candidate keys for r: consider r (a, b, c, d, e) with fds, what are the candidate keys for r, what is the highest normal form for r, normalize r into 3nf. 04ex-2: consider r (a, b, c, d, e) with fds: Which of the following functionally determine e: abc, bc, be, c, consider r (a, b, c, d, e) with fds, ab c, bd e, c d, ab c, ae b, bc d, cd e, de a, a b, b e, bd c, ch a, de f, eg h. If no, give a database instance as a counterexample to disprove it: bc a, bd a, d b, d c, consider r (a, b, c, d, e, f, g, h) with fds: Determine whether for each of the following statement holds. If yes, provide a formal proof using only the.