If someone walk me though the following questions I'd be very grateful.
Consider a relation R(A, B, C, D, E) with the following functional dependencies:
A, B → C D, E → C B → D
i) decompose R so that it is in 2nd normal form.
Second part of the question: ii) suppose R is populated with the following data:
| A | B | C | D | E | | a1 | b1 | c1 | d1 | e1 | | a2 | b1 | c2 | d1 | e2 | | a2 | b2 | c1 | d3 | e2 |
Show that your 2NF decomposition is lossless with respect to joins. To do this , produce a join expression amongst the decomposed tables, and show that its execution results in the original table above.