Answer the following problems.
problem 1) Consider the following schedule and describe which schedules are conflict-equivalent and complete.
S_{1}={R_{2}(z),W_{2}(x),W_{2}(y),C_{2},W_{1}(x),R_{1}(x),A_{1}, R_{3}(x),R_{3}(z),R_{3}(y),C_{3}}
S_{2}={R_{3}(z),W_{2}(x),W_{2}(y),R_{1}(x),R_{3}(x), R_{2}(z),R_{3}(y),C3,W_{1}(x),C_{2},C_{1}}
problem 2)a) Simplify the following query and check whether it is semantically correct or not.
Select eno from
ASG where
Resp = “Analyst”
AND NOT ( pno = “p_{2}"
OR DUR = 12 )
AND pno ≠ “p_{2}”
AND DUR = 12
b) Given the relation EMP (ENO, ENAME, TITLE)
Let P1 & P2 be the two simple predicates where
P_{1} : TITLE < “programmer”
P_{2} : TITLE > “programmer”
Suppose that char strings has order amongs then based on alphabetical order.
i) Perform the horizontal fragmentation of EMP with respect to P_{1} & P_{2}
ii) Describe whether the resulting fragmentation emp1& emp2 fulfils the correctness rules of fragmentation or not?
iii) Modify predicates P_{1} andP_{2}. if needed to satisfy correctness rules.
problem 3) Apply the algorithm INGRES to the following query and show the successive detachment and substitutions by giving mono-relation sub queries generated.
Select ename, sal from EMP, ASG , PROJ, Pay
Where EMP. eno = ASG . eno
AND EMP. title = Pay, title
AND Budget > 200000
OR DUR = 24
problem 4) Define deadlock? How deadlock can be managed?
problem 5) Describe the problems why DBMS bypass OS buffer manager and manage the disk & main memory.
problem 6) Describe the issues of global directory.
problem 7) Describe the process of localization.
problem 8) Which drawbacks of PC2PL are removed by D2PL?