edited by
2,249 views

4 Answers

Best answer
4 votes
4 votes
Any schedule produced by basic time based protocol is confluct-serialuzable (there is an equivalent serial schedule which is conflict equivalent).

Same is the case for 2PL scheme. Any schedule produced by 2PL scheme is conflict serializable.

Now coming to the actual question -- answer is no. Infact 2PL and time stamp based approach both produces a strict subset of all possible conflict serializable schedules. Also not all schedules produced by 2PL can be produced by a timestamp based approach or vice versa.
selected by
1 votes
1 votes

suppose, TS(T1)=10 & TS(T2)=20, then following schedule is conflict serializable.

T1 T2
  W(Q)
R(Q)  

but, this is not possible under timestamp because it violets T1-->T2 

0 votes
0 votes
as pointed out by @miniR, it is not necessary.

Timestamp ordering protocol requires the schedule to be conflict serializable in the order of the increasing timestamps. For example,

Let TS(T1) = 10, TS(T2) = 20; If the schedule turns out to be conflict serializable in the order T2->T1, it still does not get accepted in the timestamp protocol, and T1 gets aborted and re-enters the system with a new timestamp.
edited by

Related questions

0 votes
0 votes
1 answer
2
Harsh Saini_1 asked Dec 27, 2023
332 views
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$