Determine all candidate keys of the above table and prove it by using Armstrong Axioms [SCORE: 10] b. in which normal form (1NF, 2NF, 3NF, or BCNF, which one?) the above table ? [SCORE: 5] c. Do decomposition to normalize that table to become BCNF. [SCORE:5] d. Write an SQL statements to reconstruct the original (the un-normalized) table from the normalized tables. [SCORE: 5]

  

Transcribed Image Text:

We have a project to develop a database system in a company, but unfortunately we do not have any information regarding the business rule of that company. We are just given an old database and its functional dependencies without understanding the meaning of the business rule and also do not know the meaning of each column. Everything is a black-box Given the following table and the functional dependencies: Column A Column B Column C The functional dependencies is as follows: AB C B,C-A A,B,D-E Column D Column E We have a project to develop a database system in a company, but unfortunately we do not have any information regarding the business rule of that company. We are just given an old database and its functional dependencies without understanding the meaning of the business rule and also do not know the meaning of each column. Everything is a black-box Given the following table and the functional dependencies: Column A Column B Column C The functional dependencies is as follows: AB C B,C-A A,B,D-E Column D Column E

Answer rating: 100% (QA)

Lets break down each part of your question a Determine all candidate keys of the above table and pro... View the full answer