Assignment#3

Note: The submission date is 17/08/2011 before the start of the class and zero mark will be awarded for submission in or after the class. Q#1: Using the following relational schema, write the queries in relational algebra. Employees (Eid, Ename, Street, City) Works_in (Eid, Did, Salary) Department (Did, Dname, City) Manages (Eid, Did, Since) I. Find the name of all employees who works in CS department. II. Find the names and ids of all employees who live in the same city as the department for which they work. III. Find the names, street address and cities of employees who work in Accounts department and earns more than Rs. 30,000 per month. Q#2: Answer part 2, 3 and 4 of exercise 4.4 on page#128 of the text book. Q#3: Given a relation R (A,B,C,D,E) and the set of functional dependency F={A-> B, BC-> E, ED->A}. List all the keys (superkey and candidate key) for R by mentioning it. Q#4: Assume that R={A,B,C,D,E} is decomposed into R1={A, B, C} and R2 ={A,D,E}. Show that this decomposition is lossless-join decomposition if the set of functional dependencies F = {A->BC, CD->E, B->D, E->A} holds.