587 views

4 Answers

0 votes
0 votes

@samarpita

A schedule is strict - has the strictness property - if for any two transactions T1, T2, if a write operation of T1 precedes a conflicting operation of T2 (either read or write), then the commit or abort event of T1 also precedes that conflicting operation of T2…

Any strict schedule is cascade-less, but not the converse. Strictness allows efficient recovery of databases from failure...

 

@@ https://www.youtube.com/watch?v=Jw3jDTAXuAk 

 

1. https://gateoverflow.in/79467/What-is-strict-recoverable-schedule 

 

2. https://gateoverflow.in/66950/Serializablity-and-recoverability-of-schedules 

 

3. https://gateoverflow.in/297550/Madeeasy-test-series-2019-databases-transaction-concurrency

 

 

0 votes
0 votes

yes this is true  every strict recoverable schedule is conflict serializable.

 

Strict schedule:

if a transaction T1 perform W(A)  then T(2) should not allowed  to R(A) or W(A)  till  T(1)

COMMIT OR ROLLBACK

 

now you know every strict schedule is conflict but every conflict sehedule is not strict

0 votes
0 votes

Every Serial Schedule is a Strict Schedule by definition. But not every Strict Schedule is a Serial Schedule.

Every Strict Schedule is Conflict Serializable (there are no conflicts in Strict Schedules to begin with) but not every Conflict Serializable Schedule is Strict.

0 votes
0 votes

No, every strict recoverable schedule is not conflict serializable. Because

T1 T2
R(x)  
  R(y)
W(y)  
  w(x)

It is not conflict serializable but it is strict schedule.

Related questions

0 votes
0 votes
2 answers
1
2 votes
2 votes
0 answers
2
vinay chauhan asked Jan 18, 2019
576 views
Is different 2 phase locking a subset of each other? For example, if the schedule is Strict 2PL then it will also be simple 2PL.Something like a 2PL is a subset of Strict...
0 votes
0 votes
1 answer
3
jatin khachane 1 asked Jan 16, 2019
1,315 views
Is the following schedule conflict serializableT1T2T3W(X) commit R(X) W(X) R(X) W(X) commit W(X) commit