Explain the process of decomposing a relation to achieve higher normal forms and the potential trade-offs involved.

Explain how functional dependencies can be used to indicate the following: A one-to-one relationship set exists between entity sets student and Instructor. A many-to-one relationship set exists between entity sets student and instructor.

Give examples of relations that are:(a) reflexive and symmetric but not transitive(b) reflexive and transitive but not symmetric(c) symmetric and transitive but not reflexive

The difference between a weak entity set and a strong entity set should be explained.

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?

Explain how functional dependencies can be used to indicate the following:• A one-to-one relationship set exists between entity sets student and instructor.• Amany-to-one relationship set exists between entity sets student and instructor.

Explain how functional dependencies may be used to indicate: • The entity sets student and teacher have a one-to-one relationship set.• Between entity setsstudent and teacher, there is a many-to-one connection set.

Suppose the advisor relationship set were one-to-one. What extra constraints are required on the relation advisor to ensure that the one-to-one cardinality constraint is enforced?

Decompose the above relation using the Boyce-code normal form decomposition. What is the key relation for the relation R

The following questions relate to the following relation    STUDENT (StudentNumber, FamilyName, Degree, Major, GPA) (you should assume that a Degree has many Majors, and that a student can take many Majors, but only one Degree. GPA is Grade Point Average)   Using this relation… List the relation’s superkey(s) List the relation’s candidate key(s) Explain the Entity integrity constraint