Multivalued Dependencies & Fourth Normal Form

Functional Dependency S b Q c W Domain (X) Range (Y)

Functional Dependency Recall that if X uniquely determines Y, then Y is functionally dependent on X(X->Y) You may recall math the terms Domain and Range. The domain is the set of all values possible of X and the range is the set of all possible values of Y. The relation is a function because each of the elements of X maps exactly to one element of Y.

Multi valued Dependency (MVD) Smith Jones Cooper Anna John Lila Elsa Chris Employee (X) Dependent (Y)

Definition of MVD A multivalued dependency on R, X ->>Y, says that if two tuples of R agree on all the attributes of X, then their components in Y may be swapped, and the result will be two tuples that are also in the relation. i.e., for each value of X, the values of Y are independent of the values of R-X-Y. Multivalued dependency is also referred as a tuple-generating dependency. The multivalued dependency also plays a role in 4NF normalization.

Properties of MVD If α ->> β, Then α ->> R − β If α ->> β and δ  γ , Then αδ ->> βγ If α ->> β and If β ->> γ, then α ->> γ - β A decomposition of R into (X, Y) and (X, R-Y) is a lossless-join decomposition if and only if X ->> Y holds in R.

Decomposition Theorem The split of relations is guaranteed to be lossless if the intersection of the attributes of the new tables is a key of at least one of them. The join connects tuples depending on the attribute (values) in the intersection. If these values uniquely identify tuples in the other relation we do not lose information.

Example of lossy decomposition Original table A B C 1 2 A C 1 2 A B 1 2 A B C 1 2 Reconstruction

MVD Example namephones Name beersliked name addr phones beersLiked sue a p1 b1 sue a p2 b2 sue a p2 b1 sue a p1 b2

MVD Example Drinkers(name, addr, phones, beersLiked) A drinker’s phones are independent of the beers they like. namephones and namebeersLiked. Thus, each of a drinker’s phones appears with each of the beers they like in all combinations.

4NF Definition A relation R is in 4NF if and only if, for every one of its non-trivial multivalued dependencies XY, X is a superkey—that is, X is either a candidate key or a superset thereof. Nontrivial MVD means that: Y is not a subset of X, and X and Y are not, together, all the attributes.

Decomposition into 4NF If XY is a 4NF violation for relation R, we can decompose R using the same technique as for BCNF. XY is one of the decomposed relations. All but Y – X is the other.

4NF Decomposition Example Drinkers(name, addr, phones, beersLiked) FD: nameaddr MVD’s: namephones namebeersLiked Key is {name, phones, beersLiked}. All dependencies violate 4NF.

4NF Decomposition Example (cont.) Decompose using nameaddr: Drinkers1(name, addr) In 4NF; only dependency is nameaddr. Drinkers2(name, phones, beersLiked) Not in 4NF. MVD’s namephones and namebeersLiked apply. No FD’s, so all three attributes form the key.

4NF Decomposition Example (cont.) Decompose Drinkers2 Either MVD name ->-> phones or name ->-> beersLiked tells us to decompose to: Drinkers3(name, phones) Drinkers4(name, beersLiked)

An Example This relation has extraneous tuples Must be removed to be in 4NF StudentName Major Classes smith CS Null Math CS146 Math104 CS151 StudentName Major smith CS Math StudentName Classes Smith CS146 Smtih Math104 CS151 These are both now in fourth normal form

Checking for Multivalued Dependencies You must check for all like tuples For example: A->>B A B C 1 3 5 2 4 6 7 8 In this case you have to calculate for the tuples shown in each chart. A B C 1 3 5 7 A B C 2 4 6 8

Checking for Multivalued Dependencies, Cont. There is an easy way to check! First, write the tuples to be compared A B C 1 3 5 7

Checking for Multivalued Dependencies, Cont. Next, write the attributes in the multivalued dependency on the chart, underneath their current place in the same order A B C 1 3 5 7

Checking for Multivalued Dependencies, Cont. Next, write the extra attributes below the originals, but swap the order as shown A B C 1 3 5 7

Checking for Multivalued Dependencies, Cont. Then check relation to see if all the dependencies exist A B C 1 3 5 7 A B C 1 3 5 2 4 6 7 8 Not all exist, so this is not a proper multivalued dependency

Fifth Normal Form An entity is in Fifth Normal Form (5NF) if, and only if, it is in 4NF and every join dependency for the entity is a consequence of its candidate keys.   A relation decompose into two relations must have the lossless-join property, which ensures that no spurious tuples are generated when relations are reunited through a natural join operation.

Example

Decomposition Redundancy can be removed, Now join these relations, The row marked with the arrow is a spurious row.

Domain Key Normal Form A relation is in DK/NF if every constraint on the relation is a logical consequence of the definition of keys and domains.