Register

transactions

• edited by
286 views
0 votes
0 votes
can anyone explain this question based on no of recoverable schedules?

consider the following transactions:

T1:W(A);W(B);R(C);C;

T2:W(B);R(B);C;

the number of schedules of T1 and T2 recoverable are?
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
2
Rutuja Desai asked Dec 2, 2021
697 views
DBMS - Transactions and concurrency control
I had a doubt. In the case of lost update problem (special case of write – write problem, where a transaction commits to a blind write and the other transaction rollsback without commiting) , is the schedule recoverable or not??
I had a doubt.In the case of lost update problem (special case of write – write problem, where a transaction commits to a blind write and the other transaction rollsbac...
User Avatar
0 votes
0 votes
1 answer
3
aditi19 asked May 9, 2019
469 views
Any good resource for developing concepts on transactions in SQL?
User Avatar
1 votes
1 votes
2 answers
4
jatin khachane 1 asked Jan 25, 2019
1,389 views
Transactions
T1 LOCK-X (A) LOCK-S (B) R(A) R(B) W(A) UNLOCK (A) COMMIT UNLOCK (B) is this following CONSERVATIVE 2PL ? doubt : in conservative locking schme ..all locks are aqured before starting but locks can be released at ANY time ..so conservative need not be strict/rigorous OR is it only after commit ??
T1LOCK-X (A)LOCK-S (B)R(A)R(B)W(A)UNLOCK (A)COMMITUNLOCK (B)is this following CONSERVATIVE 2PL ? doubt : in conservative locking schme ..all locks are aqured before start...
User Avatar
Link Copied!