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


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.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of 1.18 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.