Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Specification Functional Dependency Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. Provide justification of each answer. A solution with no comprehensive justification scores no marks. 1) UNI (building#, campus, department, lecturer) The values of attributes of a relational table UNI satisfy the following properties: a lecturer belongs to only one department, a department is located in one building, a building host many departments, a department is located at one campus, a campus hosts many departments. 2) FLIGHT (passenger, phone#, flight#, seat#, departure-place, departure-time) The values of attributes of a relational table FLIGHT satisfy the following properties: a passenger has one phone number, a passenger books seats on many different flights, the attributes flight#, seat#, and departure place uniquely identify each passenger, only one flight takes of from a given departure place at a given departure time. 3) TRUCK (registration#, type, owner, driver, date-used) The values of attributes of a relational table TRUCK satisfy the following properties: a truck has a unique registration number, a truck has only one owner, a truck is used only once per day, an owner owns many trucks and driver uses many trucks. 4) EMPLOYE (employee#, skill, project) The values of attributes of a relational table EMPLOYEE satisfy the following properties: an employee has many skills,

Specification Functional Dependency Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. Provide justification of each answer. A solution with no comprehensive justification scores no marks. 1) UNI (building#, campus, department, lecturer) The values of attributes of a relational table UNI satisfy the following properties: a lecturer belongs to only one department, a department is located in one building, a building host many departments, a department is located at one campus, a campus hosts many departments. 2) FLIGHT (passenger, phone#, flight#, seat#, departure-place, departure-time) The values of attributes of a relational table FLIGHT satisfy the following properties: a passenger has one phone number, a passenger books seats on many different flights, the attributes flight#, seat#, and departure place uniquely identify each passenger, only one flight takes of from a given departure place at a given departure time. 3) TRUCK (registration#, type, owner, driver, date-used) The values of attributes of a relational table TRUCK satisfy the following properties: a truck has a unique registration number, a truck has only one owner, a truck is used only once per day, an owner owns many trucks and driver uses many trucks. 4) EMPLOYE (employee#, skill, project) The values of attributes of a relational table EMPLOYEE satisfy the following properties: an employee has many skills,

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Specification Functional Dependency Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. Provide justification of each answer. A solution with no comprehensive justification scores no marks. 1) UNI (building #, campus, department, lecturer) The values of attributes of a relational table UNI satisfy the following properties: a lecturer belongs to only one department, a department is located in one building, a building host many departments, a department is located at one campus, a campus hosts many departments. 2) FLIGHT (passenger, phone#, flight #, seat#, departure-place, departure-time) The values of attributes of a relational table FLIGHT satisfy the following properties: a passenger has one phone number, a passenger books seats on many different flights, the attributes flight#, seat#, and departure place uniquely identify each passenger, only one flight takes of from a given departure place at a given departure time. - 3) TRUCK (registration#, type, owner, driver, date-used) The values of attributes of a relational table TRUCK satisfy the following properties: a truck has a unique registration number, a truck has only one owner, a truck is used only once per day, an owner owns many trucks and driver uses many trucks. 4) EMPLOYE (employee#, skill, project) The values of attributes of a relational table EMPLOYEE satisfy the following properties: an employee has many skills, an employee participates in many projects, a skill is possessed by many employees, a project is implemented by many employees.
Transcribed Image Text:Specification Functional Dependency Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. Provide justification of each answer. A solution with no comprehensive justification scores no marks. 1) UNI (building #, campus, department, lecturer) The values of attributes of a relational table UNI satisfy the following properties: a lecturer belongs to only one department, a department is located in one building, a building host many departments, a department is located at one campus, a campus hosts many departments. 2) FLIGHT (passenger, phone#, flight #, seat#, departure-place, departure-time) The values of attributes of a relational table FLIGHT satisfy the following properties: a passenger has one phone number, a passenger books seats on many different flights, the attributes flight#, seat#, and departure place uniquely identify each passenger, only one flight takes of from a given departure place at a given departure time. - 3) TRUCK (registration#, type, owner, driver, date-used) The values of attributes of a relational table TRUCK satisfy the following properties: a truck has a unique registration number, a truck has only one owner, a truck is used only once per day, an owner owns many trucks and driver uses many trucks. 4) EMPLOYE (employee#, skill, project) The values of attributes of a relational table EMPLOYEE satisfy the following properties: an employee has many skills, an employee participates in many projects, a skill is possessed by many employees, a project is implemented by many employees.
Expert Solution
steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS