3. Decomposition – 3NF. Consider relation R=(ABCDEFG), F={AB→AC, BC→AE, AD→BCE}. (a) Is it in 3NF? Provide a good justification – must use textbook definition and reasons given must be specific. (b) Apply the 3NF decomposition algorithm to decompose R into a set of 3NF tables. If this cannot be done, explain why.

3. Decomposition – 3NF. Consider relation R=(ABCDEFG), F={AB→AC, BC→AE, AD→BCE}. (a) Is it in 3NF? Provide a good justification – must use textbook definition and reasons given must be specific. (b) Apply the 3NF decomposition algorithm to decompose R into a set of 3NF tables. If this cannot be done, explain why.

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

i need the answer quickly
Suppose you are given a database relation R with single-valued atomic attributes (A, B, C, D, E) and a set of functional dependencies F = {AB-C, AC→B, AE, B→D, BC→AE} (a) List all candidate keys for R. (6 points) (b) Name the strongest normal form that holds on R and explain. (4 points) (c) Decompose it into a collection of BCNF relations if it is not in BCNF. Show all steps. (6 points) For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). Open Sans,ari... 10pt x² X2 می P> † {;} Ка ? لاک (+ BIUS Paragraph == = 由用 EXE + Œ P - ||| ABC A П "" Ω Ix 用 : 0 WORDS POWERED BY TINY
Please don't copy
.
Using the primary key definitions from the 2NF and 3NF, order the generic definitions. Give a complete example to support your claim.
Consider the relation prereg in the University Database and its transitive closure defined in Section 5.4 of the textbook. Consider the recursive query in Figure 5.16 that outputs this transitive closure. Write a recursive query that finds all direct or indirect prerequisite of BIO-301. Output a table with one column that contains the IDs of all such prerequisites. Note that your query must work correctly not only for the given instance of prereg, but also for all possible instances. Run this query.
Identify the key(s) and functional dependencies of the relation shown in R and then identify a decomposition into Third normal form 3NF. A university consists of several departments. Each department offers several courses in different semesters. Students take admission in a department and enroll in a particular course taught by a lecturer (any lecturer may take different courses in different semester) who is from the related department and each lecturer tutors a group of students of his department. No student enrolls any course outside of his department. Each lecturer is employed for a department. Any student may retake any course to improve and all results(gpa) are recorded in R. R relation keeps records about the results (gpa) in courses taken by students in different semesters and also keeps record which lecturer taught that that course in that semester. R (StudentID, Student_name, Student_email, Department_No, Dept_name, Dept_address, Course_code, Course_title, Course_credit, GPA,…
Consider a database that has the relation schema (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on EMP it are given below. EMP Empld EmpName DeptName 1 XYA AA ХҮВ AA ХҮС AA SELECT AVG(EC. Num) 4. XYD AA FROM EC XYE AB WHERE (DeptName, Num)IN (SELECT DeptName, COUNT(Empld) AS XYF АВ XYG ХҮН AB EC(DeptName, Num) 8 AC FROM EMP XYI AC GROUP BY DeptName) 10 XYJ AC 11 XYK AD 12 XYL AD 13 ΧΥΜ AE The output of executing the SQL query is
V1
Decompose the relations, as necessary, into collections of relations that are in BCNF. R(A,B,C,D) with FD’s AB->C,C->D,and D->A. Could you show step by step procedure for this with detailed explaination?
2.Consider relation R=(A,B,C,D) with the following FDs: B → C, C > D, and D A a. List all candidate keys of R. b. Is R in 3NF? BCNF? Justify your answer
21. of 40 A decomposition is in 3NF if every decomposed relation is in 3NF. A decomposition is in BCNF if every decomposed relation is in BCNF. Let R(A,B,C,D,E,F,G) be a relation with the functional dependencies: C→ E, EG→ D, DG-→A, and A→ BF. If we decompose R into relations R1(C, D, G), R2(A, D, G), R3(A, B, F), and R4(C, E), which of the following statements is TRUE? Select one: O The decomposition is in BCNF but Not in 3NF. The decomposition is in 3NF and in BCNF. The decomposition is in 3NF but Not in BCNF. O The decomposition is Not in 3NF and Not in BCNF.