Assume the following relation tracks every time an employee is reviewed by his o
ID: 3530095 • Letter: A
Question
Assume the following relation tracks every time an employee is reviewed by his or her manager. EMPLOYEE_REVIEW(EmployeeID, ManagerID, DepartmentID, ReviewDate) An employee can only have one review on a given day, but he or she may be reviewed on different days, and different employees may be reviewed on the same day. Each employee has a single manager, and each employee belongs to a single department. However, a manager may have many employees, and a department may have many employees. a) Identify the candidate key. b) Apart from the functional dependency implied by the candidate key listed above, list an additional functional dependency. c) Place the EMPLOYEE_REVIEW table in BCNF. Be sure to identify primary and foreign keys. (For part (d), make sure the normalized tables have names other than EMPLOYEE_REVIEW.) d) Write SQL statements to copy data from the EMPLOYEE_REVIEW table to the normalized tables.Explanation / Answer
I don't really have any links, but I can give a general how-to of this:
After importing into Access: - A series of update scripts (or a single procedure, really) that copy the data into the appropriate tables - A purge statement clearing out the temp table for the next upload.
It sounds really simple, and it (actually) shouldn't be too difficult, but without knowing your table structure, it's hard to give true specifics.
1down voteI don't really have any links, but I can give a general how-to of this:
After importing into Access: - A series of update scripts (or a single procedure, really) that copy the data into the appropriate tables - A purge statement clearing out the temp table for the next upload.
It sounds really simple, and it (actually) shouldn't be too difficult, but without knowing your table structure, it's hard to give true specifics.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.