Register

serializability

520 views

2 Answers

0 votes
0 votes
T3-->T1-->T2

I guess answer C should have matched. Can be done by precedence graph.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
SakarKoot asked Sep 4, 2022
237 views
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 ?
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
0 votes
0 votes
1 answer
2
atulcse asked Jan 10, 2022
399 views
made easy - advance level full test - serializability
Consider the following schedule: R2(A), R1(A), R3(B), W3(B), W2(A), R1(A) Is the above schedule view serializable?
Consider the following schedule:R2(A), R1(A), R3(B), W3(B), W2(A), R1(A)Is the above schedule view serializable?
User Avatar
0 votes
0 votes
1 answer
3
atulcse asked Nov 2, 2021
455 views
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?
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
1 votes
1 votes
1 answer
4
Na462 asked Jan 13, 2019
1,522 views
View Serializability
Consider following Schedule S with data item x : S : W1(X) R2(X) W3(X) R4(X) W5(X) R6(X) W7(X) R8(X) W9(X) R10(X) The number of schedule view equivalent to Schedule S but not conflict equivalent to Schedule S ?
Consider following Schedule S with data item x :S : W1(X) R2(X) W3(X) R4(X) W5(X) R6(X) W7(X) R8(X) W9(X) R10(X)The number of schedule view equivalent to Schedule S but n...
User Avatar
Link Copied!