Register

Recent questions tagged conflict-serializable

306
views
1 answers
0 votes
Self Doubt on serializable
If a schedule is not conflict-serializable. Is it serializable?
User Avatar
249
views
0 answers
0 votes
Serializability
What is Proof/Explanation for complexity to test if a schedule is conflict serializable is O(n^2) whereas for view serializable is O(2^n)-Exponential ?
User Avatar
9.3k
views
2 answers
12 votes
GATE CSE 2022 | Question: 29
Let $\textit{R}_{i}(z)$ and $\textit{W}_{i}(z)$ denote read and write operations on a data element $z$ by a transaction $\textit{T}_{i},$ respectively. ... } \rightarrow T_{2}$T_{3} \rightarrow T_{1} \rightarrow T_{4} \rightarrow T_{2}$
User Avatar
498
views
1 answers
0 votes
Self doubt - Serializability - DBMS
Can a schedule be serializable if it is not view serializable? Are conflict equivalence and view equivalence the only two ways to decide if a schedule is serializable?
User Avatar
329
views
1 answers
0 votes
conflict serializable
Find Total no of conflict serializable and view serializableT1: R1(A) W1(A) R1(B) W1(B)T2: R2(A) W2(A) R2(B) W2(B)
User Avatar
7.6k
views
2 answers
13 votes
GATE CSE 2021 Set 2 | Question: 32
Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ ... and $Q$ is false$P$ is false and $Q$ is trueBoth $P$ and $Q$ are false
User Avatar
5.9k
views
3 answers
9 votes
GATE CSE 2021 Set 1 | Question: 32
Let $r_i(z)$ and $w_i(z)$ denote read and write operations respectively on a data item $z$ by a transaction $T_i$. Consider the following two ... $S_1$ and $S_2$ are conflict serializableNiether $S_1$ nor $S_2$ is conflict serializable
User Avatar
885
views
0 answers
2 votes
NIELIT 2017 July Scientist B (CS) - Section B: 46
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $x$, denoted by $r(x)$ and $w(x)$respectively. Which one ... (x)$r_2(x);w_2(x);r_3(x);r_1(x);w_1(x)$1$2$3$4$
User Avatar
8.4k
views
1 answers
2 votes
Geeksforgeeks: GATE CS Mock 2018
Consider the given schedule and choose the suitable option S = T1:R(x), T1:R(y), T1:W(x), T2:R(y), T3:W( ... not view serializableSchedule is view serializable but not conflict serializableNeither view serializable nor conflict serializable
User Avatar
743
views
0 answers
1 votes
Made Easy Databases
Consider the following schedules with data item xThe number of serial schedules which are view equal to schedules but not conflict equal is ___________.
User Avatar
516
views
0 answers
0 votes
self doubt
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict ... schedule equal to T2->T1 being calculated??It is very confusing please Help!!!!!
User Avatar
645
views
2 answers
0 votes
Self doubt on 2PL protocol
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ?I mean ,if a schedule is conflict ... to a serial schedule and serial schedules won't have deadlocks .Right ?
User Avatar
946
views
2 answers
0 votes
Gate Previous Year Question-2009
I am getting the answer as c but the given answer is b. How b can be ans, there is a cycle R1x->W1x (s1->s2) and W1y->w1y(s2->s1),so s1,s2 can not be conflict serializable… i m confused.. what is the right answer?
User Avatar
552
views
0 answers
0 votes
me adv test
Consider the following schedule:S:R2(A), W1(B), W1(C), R3(B), R2(B), R1 (A), commit_1, R2(C), commit_2, W3(A), commit_3How many given statements ... allowed by strict 2PL.only 1 is correct as per my answer but in answer they have given 3
User Avatar
361
views
0 answers
0 votes
Is there any example of schedule which is Strict but not serializable
I have gone through link https://stackoverflow.com/questions/40859477/is-a-strict-schedule-always-serializableBut i don't think example given there is correct.I ... T1 commits.Hence is any other example which is strict but not serializable?
User Avatar
336
views
0 answers
0 votes
UPPCL AE 2018:71
Consider the following transactions with data items $\text{P}$ and $\text{Q}$ initialized to zero:T1: read (P); read (Q); if P = ... schedule for which a precedence graph cannot be drawnA schedule that is not conflict serializable
User Avatar
1.4k
views
0 answers
0 votes
Conflict serializability
Is this statement"every conflict serializable schedule is also view serializable but vice-vice-versa is not true" is true?
User Avatar
4.6k
views
1 answers
1 votes
SCHEDULING
Consider the transactions T1, T2, T3 with the following schedule S:S : T1: Read (x); T2: Read (z); T1:Read(z); T3:Read(x);T3:Read( ... serializable, the equivalent serial schedule is ____. i am getting T3T1T2 but answer given is T3T2T1
User Avatar
806
views
2 answers
1 votes
Transaction dbms self doubt
T1T2R(A) W(A)W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN
User Avatar
628
views
0 answers
1 votes
2 Phase Locking
is it supported by 2PL?
User Avatar
2.4k
views
1 answers
2 votes
Raghuramkrishnan
T1T2T3R(X)W(X)commitW(X)commitR(X)commit is this transaction conflict serializable and view serializable?
User Avatar
726
views
1 answers
0 votes
Raghuramkrishnan
T1 T2 T3W(Y)commitR(X)R(Y)W(Z)commitW(X)commitis this schedule a strict schedule?
User Avatar
1.3k
views
1 answers
1 votes
RaghuramKrishnan
Tl:W(X), T2:R(X), Tl:W(X), T2:Commit, Tl:Abortis this schedule conflict serializable?
User Avatar
492
views
0 answers
0 votes
Serializable Schedule
It's a question I already asked and correct answer is 2 but what's wrong with this approach help me :(
User Avatar
916
views
0 answers
0 votes
Number of Conflict Equal and View Equal Schedules
How many Conflict Serializable and View serializable schedules for the Schedule given below$S:r_1(A),w_1(B),w_1(C),r_2(A),w_2(B),w_2(C)$To both my answer comes to be 7.Is it correct?
User Avatar
1.1k
views
1 answers
5 votes
Conflict Serializabilty
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)$
User Avatar
450
views
0 answers
0 votes
2pl protocol
Can someone explain how transactions can be serialized in order of their lock points (the point where the transactions acquire their final lock)?
User Avatar
Page: