Problem
Consider a relation schema R (A, B, C, D, E) and FDs the set F:
F ={
B → EA
EBC → D
BED → A
}
i. Find the candidate keys of R.
ii. Find the canonical cover and the minimal cover of R.
iii. Find the highest (i.e. strictest) normal form (no NF, 1NF, 2NF, 3NF, BCNF) that R satisfies. Explain your answer.
iv. If R is not in 3NF, decompose it in 3NF.