. Consider the relation R, which has attributes that hold schedules of courseand sections at a university; R = {Course_no, Sec_no, Offering_dept,Credit_hours, Course_level, Instructor_ssn, Semester, Year, Days_hours, Room_no,No_of_students}. Suppose that the following functional dependencies hold on R:irses{Course_no) → {Offering_dept, Credit_hours, Course_level}{Course_no, Sec_no, Semester, Year} → {Days_hours, Room_no,No_of_students, Instructor_ssn}{Room_no, Days_hours, Semester, Year} → {Instructor_ssn, Course_no,Sec_no}Try to determine which sets of attributes form keys of R. How would younormalize this relation?

Let us first of all make use the following shorthand notation: C = the CourseNo, SN = the SecNo, OD…

. Consider the relation R, which has attributes that hold schedules of courses and sections at a university; R = {Course_no, Sec_no, Offering_dept, Credit_hours, Course_level, Instructor_ssn, Semester, Year, Days_hours, Room_no, No_of_students}. Suppose that the following functional dependencies hold on R: (Course_no) → (Offering_dept, Credit_hours, Course_level) (Course_no, Sec_no, Semester, Year) → (Days_hours, Room_no, No_of_students, Instructor_ssn) (Room_no, Days_hours, Semester, Year) → (Instructor_ssn, Course_no, Sec_no) Try to determine which sets of attributes form keys of R. How would you normalize this relation?

. Consider the relation R, which has attributes that hold schedules of courses and sections at a university; R = {Course_no, Sec_no, Offering_dept, Credit_hours, Course_level, Instructor_ssn, Semester, Year, Days_hours, Room_no, No_of_students}. Suppose that the following functional dependencies hold on R: (Course_no) → (Offering_dept, Credit_hours, Course_level) (Course_no, Sec_no, Semester, Year) → (Days_hours, Room_no, No_of_students, Instructor_ssn) (Room_no, Days_hours, Semester, Year) → (Instructor_ssn, Course_no, Sec_no) Try to determine which sets of attributes form keys of R. How would you normalize this relation?

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, which has attributes that hold schedules of courses and sections at auniversity;R = {CourseNo, SecNo, OfferingDept, CreditHours, CourseLevel, InstructorSSN, Semester, Year,Days_Hours, RoomNo, NoOfStudents}.Suppose that the following functional dependencies FDs hold on R:{CourseNo} → {OfferingDept, CreditHours, CourseLevel}{CourseNo, SecNo, Semester, Year} → {Days_Hours, RoomNo, NoOfStudents, InstructorSSN}{RoomNo, Days_Hours, Semester, Year} → {InstructorSSN, CourseNo, SecNo}Try to determine which sets of attributes form keys of R. How would you normalize this relation?
14.28. Consider the relation R, which has attributes that hold schedules of courses and sections at a university; R = {Course_no, Sec_no, Offering_dept, Credit hours, Course_level, Instructor_ssn, Semester, Year, Days_hours, Room_no, No_of_students). Suppose that the following functional dependencies hold on R: [Course_no] → [Offering_dept, Credit hours, Course_level] (Course_no, Sec_no, Semester, Year) → (Days_hours, Room_no, No_of_students, Instructor_ssn) (Room_no, Days_hours, Semester, Year) (Instructor_ssn, Course_no, Sec_no} Try to determine which sets of attributes form keys of R. How would you
Given:1. The universal relation schema Q(CTHRSG), where C = course, T = teacher, H = hour, R = room, S= student, and G = grade.2. The minimal set of functional dependencies F are assumed: C ->T each course has one teacher HR -> C only one course can meet in a room at one time. HT -> R a teacher can be in only one room at one time. CS -> G each student has one grade in each course. HS -> R a student can be in only one room at one time. 3. The decomposition of the universal schema Q(CTHRSG) based on the algorithm (Lossless Join and Dependency-Preserving Decomposition into 3NF Relation Schema) is:D = {R1, R2, R3, R4, R5}, where R1 = {CT} R2 = {HRC} R3 = {HTR} R4 = {CSG} R5 = {HSR} 4. HS is the key of R, and is a part of R5. Please apply the Lossless Join Testing algorithm to see if the decomposition D is a lossless join decomposition. Please provide testing details step by step when you apply the set of functional dependency for testing.
Consider a relation schema R = {A, B, C, D, E} and its functional dependency set F = {A → B,CD → E,B →D,E → A}. Compute A+ and choose the answer.(a) A+ = AB(b) A+ = ABC(c) A+ = ABCD(d) A+= ABCDE(e) none of the above
Consider a relation schema R = {M, N, P, Q, S} and its functional dependency set F = {N → Q,S → M,M →P,P → S}. Is MN a super key of R? Is MN a candidate key of R? (a) MN is not a super key for R; MN is not a candidate key for R.(b) MN is a super key for R; MN is not a candidate key for R.(c) MN is a super key for R; MN is a candidate key for R.(d) MN is not a super key for R; MN is a candidate key for R.
Given a relation R(P ,Q ,R ,S, T, U,V,W, X,Y) and functional dependency set FD = {PQ→R,P→ST,Q→U,U→VW and S→XY} determine whether the given R is in 3NF? If not convert it into 3NF?
Consider a relation schema R = {A, B, C, D, E, G} and its functional dependency set F = {A → BCD,BC →DE,B → D,D → A}. Compute B+and choose the answer.(a) B+= AB(b) B+= ABC(c) B+= ABCD(d) B+= ABCDE(e) none of the above
Consider a relation schema R = {A, B, C, D, E} and its functional dependency set F = {A → BC,CD → E,B →D,E → A}. Let R be decomposed into R1 and R2, where R1 = (A,B,C) and R2 = (A,D,E). Is the decompositionlossless? Is the decomposition dependency preserving? (a) The decomposition is lossless and dependency preserving.(b) The decomposition is neither lossless nor dependency preserving.(c) The decomposition is not lossless but dependency preserving.(d) The decomposition is lossless but not dependency preserving.
1. Consider a relation schema R1(A, B, C, D) that satisfies the set of functional dependencies F1 ={A→B, B→C, C→A}.a) Calculate A + and (AC)+b) Can AB→ C? Justify your answer.c) Find all the candidate keys of R1 using F1 and show your steps to find them. 2. Consider a relation schema R2(A, B, C, D) that satisfies the set of functional dependencies F2 = {A→B, C→D, D→AC}.a) Is (AD) is candidate key of R2? Justify your answer.b) Is R2 in BCNF? Explain the reason to your answer.c) If R2 is not in BCNF, give a lossless-join BCNF decomposition of R2. Is this decomposition dependency preserving? 3. Consider a relation schema R3(A, B, C, D, E) that satisfies the set of functional dependencies F3 = {A → BC, AC → BD}.a) Calculate (AC)+ and (AE)+b) Is AB → C in F3 +? Justify your answer.c) Find the canonical cover Fc of F3.d) Is R3 in 3NF? Explain the reason to your answer. If R3 is not in 3NF, give a lossless-join, dependency preserving 3NF decomposition of R3.
Functional Dependencies and Normalization Exercise 1: Consider the following relation: Stock(#prod, #dep, pname, quantity) Determine the functional dependencies on Stock. For each of them, explain what they mean in plain English. Is Stock 3NF? Is Stock BCNF? Exercise 2: Consider the following relation: Plane(#plane, type, constructor, capacity, owner) Determine the functional dependencies on Plane. For each of them, explain what they mean in plain English. Is Plane 3NF? Is Plane BCNF? Exercise 3: Compute the attribute closure of XZA with respect to the following set of dependencies: F = {XZ => ZYB, YA -> GC, C -> W, B -> G, XZ -> G} Is the dependency XZA -> YB implied by F? Hint: Use the Armstrong axioms. Exercise 4: What are the properties of the BCNF decomposition algorithm? Explain lossless and dependency preservation with your own words. Apply the decomposition algorithm on Stock.
Consider a relation schema R(A, B, C, D, E, G) and a set of functional dependencies F = {A → C, AD → CE, B → ACD, C → B}. (a) Show the steps of computing a canonical cover for F. (b) Compute the closure of AG and then determine whether or not AG is a candidate key. (c) Determine whether or not (A, E, G) is in BCNF and justify your answer using the transitive closure of a set of attributes. If (A, E, G) is not in BCNF, find a BCNF decomposition of it. (d) Assume that (A, E, G) is decomposed into (A, G) and (E, G). Given the above functional dependencies, is this decomposition always lossless? If so, prove this. Otherwise, explain it using an example (i.e., a case of decomposing a table containg rows and columns into two tables). (e) Assume that R is decomposed into R1(A, B, C, D) and R2(A, E, G). Is this decomposition dependency preserving? Justify your answer.
Consider the following relation with set of functional dependenciesR(ABCDEF)ABC->D, ABD->E, CD->F, CDF->B, BF->Da) Identify the candidate key(s) in the relation with proper steps followed. Explain in detail b) Identify which normal form this relation is in and reason for the answer. Explain in detail Please answer these question in detail with full steps. I need a proper long answer. Thanks