Answer the following problems.
problem 1) Consider the following schedule and describe which schedules are conflict-equivalent and complete.
S1={R2(z),W2(x),W2(y),C2,W1(x),R1(x),A1, R3(x),R3(z),R3(y),C3}
S2={R3(z),W2(x),W2(y),R1(x),R3(x), R2(z),R3(y),C3,W1(x),C2,C1}
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 = “p2"
OR DUR = 12 )
AND pno ≠ “p2”
AND DUR = 12
b) Given the relation EMP (ENO, ENAME, TITLE)
Let P1 & P2 be the two simple predicates where
P1 : TITLE < “programmer”
P2 : TITLE > “programmer”
Suppose that char strings has order amongs then based on alphabetical order.
i) Perform the horizontal fragmentation of EMP with respect to P1 & P2
ii) Describe whether the resulting fragmentation emp1& emp2 fulfils the correctness rules of fragmentation or not?
iii) Modify predicates P1 andP2. 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?