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
chira.laura.9
0
Newbie Poster
Recommended Answers
Jump to Post@chira.laura.9
normalization problem
Can you post your code instead of instructions of what you need?
It would be easier if you did post what you have.
All 2 Replies
LastMitch
@chira.laura.9
normalization problem
Can you post your code instead of instructions of what you need?
It would be easier if you did post what you have.
peter_budo
2,532
Code tags enforcer
Team Colleague
Featured Poster
Please do not double post!
Thread closed.
If you wish to contribute please do so at http://www.daniweb.com/web-development/databases/threads/447005/normal-forms-
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.