Register

ACE-MockTest-Serializability Problem

• retagged by
676 views

1 Answer

0 0 votes

there is cycle in graph so definetly not conflict. there is blind write on Y so we have to check for view serializibility .

it also not view serializable because initial read it done b by T1 so it should be at first place but also T1 also does final write on Y so it should also come at last place . due to contadiction scheduling is not possible here

option D

Voting & Accepting an answer helps improve the community
← Previous · DBMS-Normalisation-L...Next → · CFL Automata
← Previous in category · DBMS-Normalisation-L...Next in category → · ACE TEST SERIES:-Tra...
Position:
Show:

Related questions

0 0 votes
1 1 answer
861
861 views
atulcse asked Nov 2, 2021
861 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?
1 1 vote
1 1 answer
2.0k
2.0k views
Na462 asked Jul 14, 2018
2,048 views
Serializability
4 4 votes
1 1 answer
3.6k
3.6k views
Na462 asked May 29, 2018
3,570 views
View Serializability
Consider the following schedules: Which of the following is correct about above schedule?Only view serializableOnly conflict serializableBoth conflict and view serializab...
10 10 votes
1 answers 1 answer
5.1k
5.1k views
flow2539 asked May 28, 2018
5,123 views
Are aborted transactions ALWAYS ignored when determining result/view/conflict serializability?
I am looking for some clarity on this topic. Here is some random schedule as an example:$r1(x) w1(x) r2(x) w2(x) r3(y) r3(x) w3(x) c3 a1 c2$I was told, that for conflict...