Database Assignment

Due: November 13, 2009

  1. Give an example of a serializable but not recoverable schedule
  2. Give an example of a cascadeless but not serializable schedule
  3. Give an example of a scheudle that is neither serializable or recoverable
  4. Give an example of a schedule that is both casecadeless and serializable
  5. Show the results of applying the k-means algorithm on the first 20 prime numbers with 2 clusters.
  6. Using the items milk, bread and peanut butter, provide a set of transactions such that milk is associated with bread, peanut butter is associated with bread, but the set milk and peanut butter is NOT associated with bread. Use 50% as your support threshold. Defend your answer.
  7. Problem 18.12 on page 755
  8. Consider the table below. Predict User 1's rating of Items A and B based on user similarity (1 nearest neighbor).
  9. Consider the table below. Predict User 1's rating of Items A and B based on item similarity (2 nearest neighbors).
  10. Write a joke that will make me laugh. Compare and contrast classification against collaborative filtering on selecting that joke (100 word maximum).
User 1User 2User 3
Item A11
Item B21
Item C131
Item D441
Item E332