Recent questions tagged transaction-and-concurrency

3 votes
1 answer
241
No. Of serial schedules view equal to SS: R1(A), R3(D), W1(B), R2(B), W3(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) .If possible please provide detailed solutions.Thank...
0 votes
1 answer
242
0 votes
0 answers
244
To determine it is strict we have to go from left to right or from right to left ??
0 votes
0 answers
245
1 votes
0 answers
247
S:- r1(a) , w2(a) c2 w1(a) c1 w3(a) c3Is this strict recoverable and serializable ? c1 means commit of transaction T1
0 votes
1 answer
248
0 votes
2 answers
249
A Phantom Read is when two SELECT queries within the same transaction return a different number of rows. But if the number of rows returned is the same and the data is di...
1 votes
1 answer
250
does graph based and time stamp ordering protocol ensure freedom from cascadeless rollback?
1 votes
1 answer
251
what is the difference btw ABORT AND FAIL IN TRANSACTION? PLEASE EXPLAIN WITH A SMALL EXAMPLE!
–1 votes
1 answer
252
Please explain the concept of DIRTY READ In a simplified manner w/ a small example!
5 votes
1 answer
253
Please explain the concept of Blind Write in a simplified manner w/ a small example!
3 votes
1 answer
258
Consider the following schedule:S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3Please explain how it is allowed in 2 PL
3 votes
3 answers
259
Consider the 2 transactionsT1: R(A) W(A) W(B)T2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(...
2 votes
1 answer
261
Consider the following schedule:S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B)How many serial schedules conflict equal to schedules (S)?
2 votes
1 answer
262
How many concurrent schedules are conflict serializable of given transactions T1 and T2:T1 = r1(A) W1(A)R1(B)W1(B)T2 = R2(B)W2(B)R2(A)W2(A)
0 votes
1 answer
266
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?
0 votes
0 answers
267
2 votes
1 answer
269
Which of the following protocols does not ensure conflict serializability and safety from deadlocks?Graph based protocolsTwo-phase locking protocolTime-stamp ordering pro...