Opening the paper…
Database Management Systems, Quiz 2
Let P and Q be two relations. Let D(P) be a decomposition of P based on a set M of functional dependencies. Let D(Q) be a decomposition of Q based on a set N of functional dependencies. It is known that one among D(P) and D(Q) is in 3NF and the other is in 2NF. In order to correctly classify D(P) and D(Q) as being in 3NF or 2NF,what is the MINIMAL test needed?
Let P and Q be two relations. Let D(P) be a decomposition of P based on a set M of functional dependencies. Let D(Q) be a decomposition of Q based on a set N of functional dependencies. It is known that one among D(P) and D(Q) is in 3NF and the other is in 2NF. In order to correctly classify D(P) and D(Q) as being in 3NF or 2NF,what is the MINIMAL test needed? Figure from the original question paper Consider the table **Sample** as shown below: | A | B | C | D | |---|---|---|---| | a1 | b1 | c1 | d1 | | a1 | b2 | X | d2 | | a1 | b2 | c2 | Y | | a1 | P | Q | d2 | If the functional dependency $B \rightarrow C$ and multivalued dependency $A \rightarrow\rightarrow BC$ hold on table **Sample**, then what will be the values of X, Y, P, and Q?