serializability

Which of the following statements about the Two Phase Locking (2PL) protocol is/are TRUE?

Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable...

Two transactions T₁ and T₂ are given as T1:r1(X)w1(X)r1(Y)w1(Y) T2:r2(Y)w2(Y)r2(Z)w2(Z) where ri (V) denotes a read operation by transaction Tᵢ on a variable V and wᵢ(V) denotes a...

Consider the following two phase locking protocol. Suppose a transaction $$T$$ accesses (for read or write operations), a certain set of objects $$\left\{ {{O_1},...,{O_k}} \right\...

Suppose a database schedule $$S$$ involves transactions $${T_1},\,...,\,{T_n}.$$ Construct the precedence graph of $$S$$ with vertices representing the transactions and edges repre...

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? I. 2-phase locking II. Time-stamp ordering