Data Management in Bioinformatics/Exercise 1

Figures are here: http://pipe.cs.vt.edu/~pbutler/bi_and_db/ until I can upload them (takes 4 days to get confirmed for media upload).

  Notes: 1) For each reservation, 1 <= # of drivers <= 10  

Notes:  A book seller must have at least one store. A book store must be either web-based or brick, but not both.    Maximum: n is the case where all n are one-to-one. Minimum: n-1 is the case where n-1 one-to-many    </li>

<li> </li> <li></li> <li>Obvious</li> <li> $$R(A,B,C,D,E,G)$$ decomposes into $$R_1(A,B,C)$$, $$R_2(A,C,D,E)$$, $$R_3(A,D,G)$$

The FDs $$B \rightarrow D$$, $$E \rightarrow G$$ are not preserved. $$R_1$$ and $$R_2$$ are decomposed losslessly because $$A C \rightarrow B$$ $$R_2$$ and $$R_3$$ are decomposed losslessly because $$A D \rightarrow E$$ and $$E \rightarrow G$$ translates into  $$A D \rightarrow G$$ </li> <li>#6 redone </li> <li>There are several solutions to this: </li> </ol>