460 views
1 votes
1 votes
S: r1(a), w2(a), c2, w2(a), c1

How is this schedule strict?

1 Answer

0 votes
0 votes

go to the definition of strick schedule:

A schedule is strict if: " A value written by a transaction T is not read or overwritten by other transactions until T either aborts or commits.

here transaction T2 write data on A i.e W(A) now transaction T1 has overwritten on data A i.e W(A) after transaction T2 have commited

so transaction is strick

Related questions

0 votes
0 votes
0 answers
1
Prince Sindhiya asked Jan 18, 2019
331 views
Is repetition allow in foreign key ?Give some reference
0 votes
0 votes
1 answer
2
Shukrayani asked Oct 30, 2018
343 views
A system where commutativity is considered different, in how many ways the join of n relations r1,r2, . . . ,rn canbe taken?
1 votes
1 votes
1 answer
3
Vikas Verma asked Oct 2, 2018
515 views
W1(A) W2(A) Commit1 Commit2Is aA) Concurrent ScheduleB) Recoverable ScheduleC) Cascadeless rollback Recoverable scheduleD) Strictly recoverable schedule
1 votes
1 votes
2 answers
4
Shivani gaikawad asked Sep 14, 2018
464 views
An instance of a relational schema R(A,B,C,D) has distinct values for attribute A then A can be 1) candidate key2)non key 3)super key4)none