Data Management Class Notes for 07/04/2014

Scribes: Filippo Ferrario and Hanieh Soleimani

Logical Design with Normalization

  • Lets consider another example where we have Course, Teacher and Book.



  • If we do the decomposition we obtain:



  • In this example each Course determines a set of Teachers.
  • And also determines a set of books.
  • in this case Course is multivalue dependency
  • CLOSURE:

  • All the attributes that are derivable from dependency.
  • For example if E -> G and G -> S then we can say that The closure of E is G and S.

  • We show the closure by this notation: X +
  • HOW TO COMPUTE THE CLOSURE :



    EXAMPLE 2



  • we have : (E)mployee, (T)ool, (P)roject, (H)as, (L)ocation, (S)kill, (R)oom

  • Find the minimal cover