Answered step by step
Verified Expert Solution
Question
1 Approved Answer
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,
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]
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
Step by Step Solution
★★★★★
3.44 Rating (151 Votes )
There are 3 Steps involved in it
Step: 1
Lets break down each part of your question a Determine all candidate keys of the above table and pro...Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started