Register

Recent questions tagged transaction-and-concurrency

1 votes
2 answers
61
Is a Serial Schedule always Recoverable?
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 different forum.
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...
User Avatar
1 votes
1 answer
62
Databases
Someone Please Solve it​
Someone Please Solve it​
User Avatar
0 votes
0 answers
63
concurrency control
question about concurrency control methods
question about concurrency control methods
User Avatar
0 votes
1 answer
65
if we use timeout with wait die scheme is there starvation?
In wait and die scheme we don't have starvation, if we add timeout to it, does it change? I think if we add timeout, it can cause starvation the old transaction always timeout before runnin and a new transaction will be run. Is that so?
In wait and die scheme we don't have starvation, if we add timeout to it, does it change? I think if we add timeout, it can cause starvation the old transaction always ti...
User Avatar
1 votes
1 answer
66
2 Phase Locking | Made Easy Test Series
Given Problem : S1 can be shown allowed under 2PL. However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer given is incorrect?
Given Problem : S1 can be shown allowed under 2PL.However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer give...
User Avatar
1 votes
1 answer
68
#selfdoubt
given schedule s: R2A W1B W1C R3B R2B R1A C1 R2C C2 W3A C3 How should I approach to above problem when LOCKS ARE NOT GIVEN and to find if s is 2PL ?
given schedule s: R2A W1B W1C R3B R2B R1A C1 R2C C2 W3A C3How should I approach to above problem when LOCKS ARE NOT GIVEN and to find if s is 2PL ?
User Avatar
1 votes
2 answers
69
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
1 answer
71
Haryana PGT
order of operations T1T2T1T2
order of operations T1T2T1T2
User Avatar
1 votes
4 answers
72
self doubt
every strict recoverable schedule is conflict serializable..if not then why?
every strict recoverable schedule is conflict serializable..if not then why?
User Avatar
1 votes
3 answers
73
Are all Irrecoverable/Non-Recoverable schedules cascading?
Suppose, T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: Abort Here we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it cascading?
Suppose,T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortHere we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it ...
User Avatar
1 votes
1 answer
74
view serializable
Find View Serializable T1 : R1(A) , R1(B) , W1(B) T2 : R2(A) , R2(B) , W2(B)
Find View SerializableT1 : R1(A) , R1(B) , W1(B)T2 : R2(A) , R2(B) , W2(B)
User Avatar
1 votes
1 answer
80
GATE Overflow Test Series | Mixed Subjects | Test 3 | Question: 7
Match the following: ... $a-iv,b-iii,c-ii,d-i$ $a-ii,b-iii,c-iv,d-i$ $a-iii,b-iv,c-ii,d-i$
Match the following:$$\begin{array}{|ll|ll|} \hline\text{a.}& \text{Transaction Failure} & \text{i.}&\text{Transaction Manager}\\\hline\text{b.}& \text{Concurrency Contro...
User Avatar
0 votes
1 answer
87
NIELIT 2016 MAR Scientist B - Section C: 34
Global locks synchronize access to local resources. synchronize access to global resources. are used to avoid local locks. prevent access to global resources.
Global lockssynchronize access to local resources.synchronize access to global resources.are used to avoid local locks.prevent access to global resources.
User Avatar
20 votes
5 answers
90
GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
User Avatar
Page: