Register

The time stamp of two transactions T1 and T2 are 10 and 15. Consider the following schedule with T1 and T2 operations.

1,671 views
2 votes
2 votes

The time stamp of two transactions T1 and T2 are 10 and 15 respectively. Consider the following schedule with T1 and T2 operations.

S1:r1(x),w1(x),r2(x),w2(x),r1(y),w1(y),r2(y),w2(y)

Find the schedules?

  • S is serializable using basic timestamp protocol

  • S is serializable using basic Thomas write rule

  • S is serializable using basic multiversion timestamp

  • All of these

User Avatar

1 Answer

Best answer
3 votes
3 votes

All are correct!

Basic timestamp ordering protocol:

Source: Databasdatae Systems by Navathe 6th Edition

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
techbrk3 asked Nov 9, 2017
1,685 views
Consider a schedule with three transactions. T1, T2 and T3 executed concurrently.
The schedule is given below. Find out the category of the schedule S: R1(X),R2(Z)R1(Z),R3(X) W1(X) W3(Y) R2(Y) W2(Z) W2(Y) C1 C2 C3 Recoverable schedule Conflict Serializable Strict schedule None of these
The schedule is given below. Find out the category of the scheduleS: R1(X),R2(Z)R1(Z),R3(X) W1(X) W3(Y) R2(Y) W2(Z) W2(Y) C1 C2 C3Recoverable scheduleConflict Serializabl...
User Avatar
6 votes
6 votes
3 answers
2
Vikrant Singh asked Jan 29, 2015
18,074 views
Consider 3 transactions T1, T2 and T3 having 2, 3 and 4 operations respectively.
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?
User Avatar
17 votes
17 votes
1 answer
3
nilamd asked Dec 21, 2015
4,580 views
How many recoverable schedules are possible from T1 and T2?
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$
Consider the following Two Transactions.A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ?$51$$52$$55$$56$ B) How many cascadeless recoverable s...
User Avatar
0 votes
0 votes
1 answer
4
bts asked Jun 30, 2018
1,240 views
Two phase locking and time stamp
Which of the following is correct ? I.Two phase locking is an optimistic protocol. II. Two phase locking is pessimistic protocol III. Time stamping is an optimistic protocol. IV. Time stamping is pessimistic protocol. A I and III B II and IV C I and IV D II and III
Which of the following is correct ? I.Two phase locking is an optimistic protocol. II. Two phase locking is pessimistic protocol III. Time stamping is an optimistic proto...
User Avatar
Link Copied!