Data Management in Bioinformatics/Exercise 1

From Wikibooks, open books for an open world
Jump to: navigation, search

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).

  1. File:Problem1.svg
    Notes: 1) For each reservation, 1 <= # of drivers <= 10
  2. Problem2.png
    Notes:
    • A book seller must have at least one store.
    • A book store must be either web-based or brick, but not both.
  3. Maximum: n is the case where all n are one-to-one. Minimum: n-1 is the case where n-1 one-to-many
  4. File:Problem4.svg
  5. File:Problem5.svg
  6. FD Trivial
    YES
    NO
    NO
    NO
    NO
    YES
    MD Trivial
    YES
    NO
    YES
  7. Obvious
  8. decomposes into , ,
    The FDs , are not preserved.
    and are decomposed losslessly because
    and are decomposed losslessly because and translates into
  9. #6 redone
  10. There are several solutions to this:
    LHS RHS
    (superset)
    (superset)