Database Concepts (7th Edition)
Database Concepts (7th Edition)
7th Edition
ISBN: 9780133544626
Author: David M. Kroenke, David J. Auer
Publisher: PEARSON
Expert Solution & Answer
Book Icon
Chapter 2, Problem 2.36RQ

Explanation of Solution

Determinant in following relation:

Assumption 1:

PetName → (PetType, PetBreed, PetDOB, OwnerLastName, OwnerFirstName, OwnerPhone, OwnerEmail)

In the above expression, PetName attribute determines PetType, PetBreed, PetDOB, OwnerLastName, OwnerFirstName, OwnerPhone, and OwnerEmail attributes, left term “PetName” refers the determinant, and “→” defines the relationship.

  • That is, the PetType, PetBreed, PetDOB, OwnerLastName, OwnerFirstName, OwnerPhone, and OwnerEmail are functionally dependent on PetName.

Therefore, the “PetName” is the determinant for this assumption.

Assumption 2:

OwnerEmail → (OwnerLastName, OwnerFirstName, OwnerPhone)

In the above expression, OwnerEmail attribute determines OwnerLastName, OwnerFirstName, and OwnerPhone attributes, left term “OwnerEmail” refers the determinant, and “→” defines the relationship.

  • That is, the OwnerLastName, OwnerFirstName, and OwnerPhone are functionally dependent on OwnerEmail.

Therefore, the “OwnerEmail” is the determinant for this assumption.

Assumption 3:

OwnerPhone → (OwnerLastName, OwnerFirstName, OwnerEmail)

In the above expression, OwnerPhone attribute determines OwnerLastName, OwnerFirstName, and OwnerEmail attributes, “OwnerPhone” refers the determinant, and “→” defines the relationship.

  • That is, the OwnerLastName, OwnerFirstName, and OwnerEmail are functionally dependent on OwnerPhone.

Therefore, the “OwnerPhone” is the determinant for this assumption.

Assumption 4:

(PetName, Date)  → (Service, Charge)

In the above expression, the last functional dependency assumes a pet is seen at most on one day, and that there is no standard charge for a service.

  • The Service and Charge attribute are functionally dependent on the composite (PetName, Date)...

Blurred answer
Students have asked these similar questions
It is possible to construct a connection such as sec course from a group of relationships that are many to one. Does the relation's many-to-one cardinality restriction get enforced by the main and foreign key constraints? Why do you think that is?
Using the assumptions you stated in your answer to question 2.32, what are the determinants of this relation? What attribute(s) can be the primary key of this relation?
For relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E) C D → B A → D E → C   1. Decompose the above relation using the Boyce-Codd Normal Form (BCNF) decomposition. 2. What is the key for the relation R?
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education