• closed by
1,543 views
0 0 votes
closed with the note: problem solved no more comment required
In the following T1 and T2 are transaction and A is an object ,which of the following  has the potential of becoming of irrecoverable schedules?

A)  T2 writes A after T1 wrote A; T1 is uncommitted

B) T2 reads A after T1 wrote A;  T1 is uncommitted

C )  T2 writes A after T1 wrote A; T1 is committed

D)   T2 reads A after T1 read A; T1 is uncommitted

1 Answer

0 0 votes
B must be the answer.

Irrecoverability is when a committed transaction has to be rolled back .

A cannot be the answer , since T2 is writing A irrespective of the changes made by T1(This is called Blind Write).

B has to be the answer , since T2 is reading what T1 wrote and T1 is not committed till now . So there's a potential chance that T2 would be needed to rollback if T1 failed , to maintain consistency.

C cannot be answer since transaction is committed and D cannot be answer since Read Read are not conflicting opertations
Position:
Show:

Related questions

1 1 vote
1 1 answer
2.1k
2.1k views
_jerry asked Jan 24, 2018
2,119 views
I can't exactly identify when a transaction has dirty read problem and when it doesn't. Take the following instances1. S:T2r(x);T3r(x);T3 commit;T2 commitThis is not dirt...
0 0 votes
0 0 answers
119
119 views
Hitesh GATE asked Aug 16, 2025
119 views
1 1 vote
2 2 answers
3.6k
3.6k views
DebRC asked Aug 16, 2022
3,628 views
Is only conflict serializable schedules are recoverable?Or both view as well as conflict serializable schedules are recoverable?I have been seeing different answers in di...
0 0 votes
1 1 answer
511
511 views
AlexDeLarge asked Feb 18, 2022
511 views
Hello there, I’m studing from this book (Elmasri – Navathe, Fundamentals of Database Systems, 7th Ed), and I'm having problems understanding this definition:A schedule S ...