In: Computer Science
Assume that you have been given the following attributes:
Team_ID, Team_Name, Team_Motto, Emp_ID, Emp_Name, Emp_Address, Emp_Skills, Task_ID, Task_Begin_Date, Task_Completion_Date, Emp_Performance
Assume there are no repeating groups. An employee can be in only one team at a time, but a team can have multiple employees. Emp_ID determines the team in which an employee works. Emp_skills is a multi-valued attribute. An employee can be assigned multiple tasks. Emp_Performance depends on the employee and the task to which they are assigned. Identify all dependencies and covert to 3 NF. First convert the above to 1NF then 2NF and lastly, 3NF. Show all work.
According to the question :-
The functional dependencies possible are as follows:-
From the above functional dependencies the candidate keys are Team_ID, Emp_ID, Task_ID.
For 1NF there should not be any composite and multivalued attributes, clearly the relation is not in 1 NF as Emp_Skills is multivalued attribute therefore the given relation will normalized as follows:-
R (Team_ID, Team_Name, Team_Motto, Emp_ID, Emp_Name, Emp_Address, Task_ID, Task_Begin_Date, Task_Completion_Date, Emp_Performance)
Skills (Emp_ID -> Emp_Skills)
For 2NF there should not be any partial dependencies, clearly there is partial dependencies present in the relation therefore the relation will break into sub relation as follows:-
For 3 NF there should not be any transitive dependency, clearly the above sub relation is in 3 NF, therefore after normalization the relation schema is derived as follows:-
In above relation schema primary keys are represented by underline and foreign keys by bold