We're a community of 1077K IT Pros here for help, advice, solutions, professional growth and fun. Join us!
1,076,018 Members — Technology Publication meets Social Media
Username:
Password:
Lost login information?
Start New Discussion Reply to this Discussion

Normal Forms

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

3
Contributors
2
Replies
4 Days
Discussion Span
3 Months Ago
Last Updated
8
Views
chira.laura.9
Newbie Poster
16 posts since Dec 2012
Reputation Points: 0
Solved Threads: 0
Skill Endorsements: 0

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.

adam_k
Veteran Poster
1,057 posts since Jun 2011
Reputation Points: 274
Solved Threads: 205
Skill Endorsements: 11

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

drjohn
Posting Pro
508 posts since Mar 2010
Reputation Points: 76
Solved Threads: 99
Skill Endorsements: 4

This article has been dead for over three months: Start a new discussion instead

Post: Markdown Syntax: Formatting Help
 
You
 
© 2013 DaniWeb® LLC
Page rendered in 0.0614 seconds using 2.7MB