Tedext

Normalization in Database with Example Tables

Normalization in Database with Example Tables
Normalization in Database with Example Tables
  1. Normalization in Database with Example Tables In 1NF, you should have a single table that does not contain any repeating groups. To go from 1NF to 2NF, you must eliminate partial dependencies. A partial dependency occurs when a non-key attribute depends on only a portion (i.e. subset) of the composite primary key. For each subset of the primary key on which one or more non-key attributes are partially dependent, you need a new table that contains a primary key specified by the portion of the composite primary key (in 1NF table) on which the non-key attribute(s) were dependent and all corresponding non-key attributes.

a.       Suppose that, when in 1NF, you have one table with five attributes making up the composite primary key. Assume an arbitrarily large number of non-key attributes. How many tables are logically possible in 2NF?  (5 points)

b.      Generalize the result from (a) to the case of N attributes in the composite primary key when in 1NF (still assume an arbitrarily large number of non-key attributes). Your answer should be a function that uses N as its argument.  (10 points)

2.Use Wikipedia to research 4NF. Using your own words, explain the potential issue with 3NF that is alleviated by 4NF. Explain how one must modify one’s database to go from 3NF to 4NF. Be detailed and specific throughout. (NOTE: I reserve the right to determine if your answer is “in your own words” or merely a regurgitation of Wikipedia or any other resource).  (15 points)

Normalization in Database with Example Tables

  • Order

  • Payment

  • Processing

  • Delivery

Validation error occured. Please enter the fields and submit it again.
Thank You ! Your email has been delivered.