1,105,208 Community Members

Normal Forms

Member Avatar
Newbie Poster
16 posts since Dec 2012
Reputation Points: 0 [?]
Q&As Helped to Solve: 0 [?]
Skill Endorsements: 0 [?]

If I have relation schema R(A, B, C, D, E) with functional dependencies: AB->C, CD->E, C->A, E->D:
a)find all the (minimal) keys for R
b)state the normal form for R and describe functional dependencies that violate higher NF
c)decompose R into 2 (or more) relations that are in highest possible normal form (if possible) and give for each relation of your decomposition a minimal basis for the FD that hold in these relations

Member Avatar
Veteran Poster
1,056 posts since Jun 2011
Reputation Points: 239 [?]
Q&As Helped to Solve: 212 [?]
Skill Endorsements: 17 [?]

I hope you don't expect us to do your homework. If you need help with something, show effort and ask for help/guidance instead of the solution.

Member Avatar
Posting Pro
526 posts since Mar 2010
Reputation Points: 50 [?]
Q&As Helped to Solve: 106 [?]
Skill Endorsements: 4 [?]

Typical homework problem.
First, you have to attempt it according to what you learned in class.
Then we might offer advice.

This article has been dead for over three months: Start a new discussion instead
Start New Discussion
Tags Related to this Article