Register

MadeEasy Subject Test: Databases - Transactions

• edited by
429 views

1 Answer

0 votes
0 votes
How to check?

Write T1 -> T2. T2-> T1.

See that none of the operations can be moved up or down
as w1(z) and r2(z) conflicts in 1st and w2(x) r1(x) conflicts in 2nd.

So none of the non serial schedule can be conflict serializable hence not 2PL.

We can have circular wait in some of the non serial ordering.

So D is correct.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
learner_geek asked Dec 1, 2017
437 views
MadeEasy Subject Test: Databases - Transactions
In below schedule (S) it has cascading abort or not?
In below schedule (S) it has cascading abort or not?
User Avatar
2 votes
2 votes
1 answer
2
shivangi5 asked Nov 24, 2017
671 views
MadeEasy Subject Test: Databases - Transactions
The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________ I am getting 54 but the given ans is 60. My doubt is are serial schedules counted or not in the concurrent schedules.
The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________I am getting 54 but the given ans is 60.My doubt i...
User Avatar
1 votes
1 votes
3 answers
4
sivajagsa asked Jan 29, 2017
1,391 views
MadeEasy Subject Test: Databases - Transactions
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) Number of serial schedules which are view equal to above S are __. Polygraph that I drew:
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B)Number of serial schedules which are view equal to above S are __.Polygraph that I drew:
User Avatar
Link Copied!