Assignment-2
Assignment-2
2.Suppose in R(A, D,H,C,E) we have two sets of functional dependencies F1 and F2.
F1={ A->C; AC->D; E-AD; E->H } F2={ A->CD; E->H }
Check ,F1 and F2 are equivalent or not? Justify.
3.Check which highest normal form will be satisfied by the given relation along with the
provided functional dependencies (f.d).
R(A,B,C,D,E,F,G,H,I,J) and f.d={ AB->C; AD->GH; BD->EF; A->I; H->J }
Also ,Decompose the table into its next higher normal form.
4.
1|Page
5.Consider the following realtions with their attributes:
EMPLOYEE(fname,lname,ssn,sex,salary,super_ssn,dno,address,birth_date)
PROJECT(Pname,Pnumber,Plocation,Dnum)
WORKS_ON(Essn,Pno,Hours)
Draw the initial query tree for the following SQL query.Then apply heuristic query
optimization on that initial query tree to find the final query tree(if any) that is efficient to
execute.
SELECT E.ssn,P.Pname,E.salary FROM EMPLOYEE AS E,WORKS_ON AS W,PROJECT
AS P WHERE E.Ssn=W.Essn AND W.Pno=P.Pnumber AND P.location=’Guntur’ AND
E.sex=’female’;
6. What is normalization? What are the conditions required for a relation to be in 3NF and
BCNF. What is the difference between 3NF and BCNF explain with example.
7.Define Query processing?what are the different steps involved in query processing with
neat Diagram.
‘UPDATE employees SET salary= salary + (salary * 10 / 100) WHERE salary > 12000’;
‘UPDATE employees SET salary= salary + (salary * 10 / 100) WHERE salary between 12000
and 20000’;
2|Page