Register

Self doubt

1,307 views
2 2 votes

Which of the following are RECOVERABLE schedules

1 Answer

1 1 vote
I think that all of them are recoverable because if a transaction Ti reads a value written by transaction Tj then Tj should commit before Ti.

If Ti commits first and error occurs before commitment of Tj then it will not be possible to redo Ti.

So in above question, T2(Which is reading value written by T1) is not committing in any of the case, so we can redo it if error occurs.
Voting & Accepting an answer helps improve the community
← Previous · PagingNext → · CO & Architecture - ...
← Previous in category · Testbook Test Series...Next in category → · Outer join Query
Position:
Show:

Related questions

2 2 votes
0 0 answers
509
509 views
Dknights asked Jan 4, 2025
509 views
self doubt on Database transactions
can someone please explain the working of computation in database transactions is the following computation correct?Time Transaction 1 (T1) Transaction 2 (T2) A (Value) 1...
1 1 vote
1 1 answer
374
374 views
Eldho_G_Peter asked Dec 14, 2024
374 views
self doubt: rigorous 2 phase locking
can someone explain why the order of transactions in a rigorous 2 phase locking is same as order of commit operations and not order of lock points as in standard 2 phase ...
0 0 votes
1 1 answer
686
686 views
kunal13 asked Jun 3, 2024
686 views
Self Doubt relate to ER diagrams(Databases).
 In (https://gateoverflow.in/219555/number-of-tables) number of tables to be made was 4, merging E1 and E2 in one table, one for R3, and for E3 and one for E4. Now based ...
1 1 vote
4 4 answers
1.3k
1.3k views
samarpita asked Nov 13, 2021
1,317 views
self doubt
every strict recoverable schedule is conflict serializable..if not then why?