452 views
0 votes
0 votes

Does the schedule below have the repeatable read problem or not?

repeatable read problem is when a transaction read a data, then another transaction comes and changes that data, another time that the first transaction wants to read that data the value has changed. some books say that that second transaction should commit before the first transaction read again and some books don't consider that. Now with respect to some books this has repeatable read problem and with respect to other books this schedule doesn't have this problem. What is the correct answer?

I have this question for inconsistent analysis too, please?

1 Answer

0 votes
0 votes

yeah ofc.

Transaction T-1 sufferes unrepeatable problem because when it read value of B again form system it got some other value than previous one , this is violation of Isolation rule of ACID properties. so answer is yes.

Related questions

0 votes
0 votes
2 answers
1
1 votes
1 votes
1 answer
2
Shefali asked Oct 10, 2015
3,445 views
0 votes
0 votes
0 answers
4
sripo asked Nov 25, 2018
1,244 views
If I have dirty read which is write-read conflict does it imply that the schedule is non recoverable?Do all anomalies result of conflict result in non recoverable thereby...