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 PostI 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.
All 2 Replies
adam_k
239
Master Poster
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.
drjohn
56
Posting Pro in Training
Typical homework problem.
First, you have to attempt it according to what you learned in class.
Then we might offer advice.
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.