Consider the following transactions with data items P and Q initialized to zero: T1 : read (P) ; read (Q) ; if P = 0 then Q : = Q + 1 ; write (Q). T2 : read (Q) ; read (P) if Q = 0 then ...
SIKSHAPATH Latest Questions
Check whether Schedule is serial, serializable, Conflict serializable S:R2(Z),R2(Y),W2(Y),R3(Y),R3(Z),R1(X),W1(X),W3(Y)W3(Z)R2(X)R1(Y)W1(Y)
Show that two-phase locking protocol ensures conflict serializability and that transactions can be serialized according to their lock points with suitable examples.
Can database Backup & Recovery from Catastrophic Failure is provided how? Illustrate with an example and possible recovery techniques.
Consider the following two transactions: T31: Read(A) Read (B) if A=0 then B=B+1 Write (B) T32: Read(B) Read (A) if B=0 then A=A+1 Write (A) Add lock and unlock instructions to transactions T31 and T32 so that they observe the two phase protocol. Can the execution of these transaction ...
Write a block in PL/SQL to print a report which shows that, the employee id, name, hire date, and the incentive amount they achieved according to their working experiences, who joined in the month of current date.