Search results for conflict-serializable

1 votes
1 answer
3
0 votes
1 answer
8
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
0 votes
0 answers
11
0 votes
1 answer
14
0 votes
0 answers
15
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 ?
0 votes
1 answer
16
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)
0 votes
1 answer
18
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?
To see more, click for the full list of questions or popular tags.