How deadlock can be managed

Question

Answer the following questions.

Question 1) Consider the following schedule and describe which schedules are conflict-equivalent and complete.

S₁={R₂(z),W₂(x),W₂(y),C₂,W₁(x),R₁(x),A₁, R₃(x),R₃(z),R₃(y),C₃}

S₂={R₃(z),W₂(x),W₂(y),R₁(x),R₃(x), R₂(z),R₃(y),C3,W₁(x),C₂,C₁}

Question 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₂"
OR DUR = 12 )
AND pno ≠ “p₂”
AND DUR = 12

b) Given the relation EMP (ENO, ENAME, TITLE)
Let P1 & P2 be the two simple predicates where
P₁ : TITLE < “programmer”
 P₂ : 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₁ & P₂

ii) Describe whether the resulting fragmentation emp1& emp2 fulfils the correctness rules of fragmentation or not?

iii) Modify predicates P₁ andP₂. if needed to satisfy correctness rules.

Question 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

Question 4) Define deadlock? How deadlock can be managed?

Question 5) Describe the problems why DBMS bypass OS buffer manager and manage the disk & main memory.

Question 6) Describe the issues of global directory.

Question 7) Describe the process of localization.

Question 8) Which drawbacks of PC2PL are removed by D2PL?