For each one of the domain specification given below, identify all the functional dependencies, and 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. 2. In a higher education institution, in a semester, students are allowed to enroll up to 2 running subjects, and each running subject may have many students enroll to it. The final grade the students receive for a subject, and the credit value of each subject are recorded in the following relational table. ENROLMENT(StdNum, SubNum, Grade, CreditValue) 3. When a staff is required to undertake an inspection of properties, the staff is allocated a company car for the day. A staff may inspect several properties on a given date, and a property is only inspected once on a given date. This information of the inspection are stored in the following relational table: PropertyInspection(PropertyNum, IDate, ITime, Comments, StaffNum, CarRegNum)

For each one of the domain specification given below, identify all the functional dependencies, and 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. 2. In a higher education institution, in a semester, students are allowed to enroll up to 2 running subjects, and each running subject may have many students enroll to it. The final grade the students receive for a subject, and the credit value of each subject are recorded in the following relational table. ENROLMENT(StdNum, SubNum, Grade, CreditValue) 3. When a staff is required to undertake an inspection of properties, the staff is allocated a company car for the day. A staff may inspect several properties on a given date, and a property is only inspected once on a given date. This information of the inspection are stored in the following relational table: PropertyInspection(PropertyNum, IDate, ITime, Comments, StaffNum, CarRegNum)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the relation r(A,B ) with the following instance of r. Which of the functional dependencies do NOThold on this instance?(a) C → A(b) B → A(c) AB → C(d) A → C(e) B → C Instance of r is attached
Consider a relational scheme R(A,B,C,D,E,H) and functional dependencies A→B,BC→D,E→C,D→A. Find all candidate keys of R.
No, there is an issue with the functional dependency. No, it is not yet in 2NF. No, there are repeating groups. Yes, it is in 3NF.
Consider a relation R(A,B,C,D,E) with functional dependencies AB→C, A→D, and D→E. (a) What are the keys for R?(b)What is the closure A, that is A+ ? What is the closure AB, that is (AC)+ ?
identify the set of functional dependencies in the relation instance CAR shown next.
Consider a relation R(A,B,C,D,E) with functional dependencies AB→C, A→D, and D→E. (a) What are the keys for R? (b) What is the closure A, that is A+ ? What is the closure AB, that is (AB)+ ?
Consider the schema R=ABCDEG and the set of functional dependenciesF={BC→AG, BG→CD, C→AE, D→AG}2a) Determine the keys of the schema2b) Decide whether the schema is 3NF and motivate your answer 2c) Find a decomposition of the schema such that:- every subschema is 3NF- preserves the dependencies- has a lossless join.
Describe the concept of data binding in the context of dependency injection frameworks like Angular.
Show that the following decomposition of the schema R of Exercise 7.1 is not alossless decomposition:(A, B, C)(C, D, E).Hint: Give an example of a relation r(R) such that ΠA, B, C (r) ⋈ ΠC, D, E (r) ≠ r
Explain the difference between a weak and a strong entity set.
Identify the set of functional dependencies in the relation instance CAR shown next. Does this constitute the minimal cover for the set of functional dependencies present in CAR? If it is not a minimal cover, define a minimal cover.
Consider a relational schema R = {A, B, C, D, E, G, H}, satisfying the functional dependencies F = {E → G, E → H, G → H, A → BC, BC → D, C → H, EG → A}. a) Derive all candidate keys for this schema. b) Derive a canonical cover of the functional dependencies in F. c) Is the above schema in BCNF? Prove or disprove. If it is not in BCNF, convert it into BCNF. d) Is the BCNF schema from (c) dependency-preserving? Prove or disprove. If not, convert into 3NF.