Recent questions tagged transaction-and-concurrency

3 votes
2 answers
181
Tl:R(X), T1:R(Y), T1:W(X), T2:R(Y), T3:W(Y), Tl:W(X), T2:R(Y)is this schedule view serializable?
0 votes
1 answer
182
0 votes
3 answers
186
0 votes
0 answers
187
In Log-Based Recovery why do we redo committed transactions?
0 votes
1 answer
188
https://gateoverflow.in/178786/transactioncan anyone confirm this question answer i am getting 90
0 votes
0 answers
189
Is this schedule is recoverable.Doubt : Here W(A) is BLIND WRITE in T1 ..does this make any difference T1 T2W(A) R(A) COMMITCOMMIT
2 votes
1 answer
190
0 votes
1 answer
191
2 votes
0 answers
192
i am finding difficulty in view serializable schedule please tell me how to check view serializablity with polygraph
0 votes
0 answers
193
T1T2R(X) W(X)W(X) abortscommit find conflict serializability,view serializability, recoverable,cascadeless and strict schedule
0 votes
1 answer
194
T1T2T3W(X) R(X) W(Y) W(X) R(Y) W(X) W(X) W(Y) W(X) W(Y) R(X) W(X) R(Y) W(Y) Number of blind write in given schedule
0 votes
0 answers
196
It's a question I already asked and correct answer is 2 but what's wrong with this approach help me :(
5 votes
1 answer
198
How many conflict equivalent schedules are possible for the given schedule ?$R_1(A), R_2(A), R_3(A), R_4(A), W_1(B), W_2(B), W_3(B), W_4(B)$
0 votes
2 answers
199
Is in conservative 2pl we release the locks after it commit $\mathbf{or}$locks can be released at any point of time and need not after commit operation ?Please Explain wi...
1 votes
1 answer
200
Let a schedule be Strict Recoverable then it will suffer from which problem?a) ww problem b) rw problemc)wr problem d) Lost update problem
0 votes
0 answers
201
1 votes
5 answers
202
is this is cascadeless?r1(X),w2(X),w1(X), abort2, commit1
0 votes
0 answers
203
0 votes
0 answers
204
Can someone explain how transactions can be serialized in order of their lock points (the point where the transactions acquire their final lock)?
1 votes
3 answers
205
HOW TO SOLVE THOSE TYPE OF QUESTION?
0 votes
1 answer
206
1 votes
0 answers
207
Are following part of gate syllabus for dbms?1-Validation Based protocols2-multiversion schemes3-snapshot isolation4-predicate reads(concurrency control)5-concurrency in ...
0 votes
0 answers
210
Question:Consider the following transactions:The number schedules of T1 and T2 recoverable are ________.