-
Notifications
You must be signed in to change notification settings - Fork 1
/
assignment_2023_03_24.sql
27 lines (21 loc) · 1.29 KB
/
assignment_2023_03_24.sql
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
-- 1. Determine the highest normal form of this relation scheme.
-- The relation scheme student Performance (StudentName, CourseNo, EnrollmentNo, Grade) has
-- the following functional dependencies:
-- StudentName, courseNo → grade
-- RollNo, courseNo → grade
-- StudentName →EnrollmentNo
-- EnrollmentNo →StudentName
-- 2. Suppose you are given a relation R= (A, B, C, D, E ) with the following functional
-- dependencies:{CE →D, D→B, C →A}
-- a. Find all candidate keys.
-- b. Identify the best normal form that R satisfies (1NF, 2NF, 3NF, or BCNF).
-- c. If the relation is not in BCNF, decompose it until it becomes BCNF. At each step, identify a
-- new relation, decompose and re-compute the keys and the normal forms they satisfy.
-- 3. You are given the following set F of functional dependencies for relation R(A, B, C, D, E, F):
-- F ={ABC → D, ABD→E,CD→F,CDF →B,BF →D}
-- a. Find all keys of R based on these functional dependencies.
-- b. Is this relation in Boyce-Codd Normal Form? Is it 3NF? Explain your answers.
-- 4. Write the advantages and disadvantages of normalization.
-- 5. Determine the decomposition.
-- Consider the schema R = (S T U V) and the dependencies S → T, T → U, U → V, and V → S.
-- Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 ≠ ∅ .