normalFormProblem

normalFormProblem - city -> status 3. R(s#, p# , status,...

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

View Full Document Right Arrow Icon
For the following, identify the highest normal form of each relation. Decompose each relation if necessary so that it is in BCNF. 1. R(f#, child , fName) FDs: f# -> fName f#, child -> f# f#, child -> child 2. R(s# , status, city) FDs: s# -> city
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: city -> status 3. R(s#, p# , status, city, qty) FDs: s# -> city s# -> status city -> status s#, p# -> qty 4. R(s#, p# , sName, qty) candidate key: sName, p# FDs: S#, p# -> qty sName, p# -> qty s# -> sName sName -> s#...
View Full Document

This note was uploaded on 02/27/2011 for the course CSE 412 taught by Professor Davulcu,h during the Spring '08 term at ASU.

Ask a homework question - tutors are online