716 views

1 Answer

1 votes
1 votes
It is not necessary for a schedule to have blind write in order to be view serializable , only if u find a schedule which is not conflict serializable u go for checking whether it is view serializable or not ,Now if blind writes are there then there may be a possibility that the schedule is view-serializable and if blind writes are not present then the schedule is not even view serializable , So now if the schedule is view-serializable , if You are able to get a sequence of transactions so that they follow all the constraints which are necessary for a schedule to be view-serializable then u r done .

You need to make sure that the transaction which makes last update should also make last update in the view-equivalent schedule and the transaction which reads the initial data item should also read the initial data item in the view-equivalent schedule , since it is a NPC problem so you can't do it in polynomial time but if u r given 2 to 3 transactions u can easily verify if u can design a view-equivalent schedule or not .

Related questions

1 votes
1 votes
1 answer
1
sambey4 asked Oct 15, 2021
295 views
Find View SerializableT1 : R1(A) , R1(B) , W1(B)T2 : R2(A) , R2(B) , W2(B)
0 votes
0 votes
0 answers
3
Upasana singh asked Oct 17, 2017
565 views
Consider the following schedule:S: r1(A), r3(D), w1(B), r2(B), r4(B), w2(C), r5(C), w4(E), r5(E), w5(B)The number of serial schedules which are view equal to schedule S ?...
7 votes
7 votes
3 answers
4
Supremo asked Jan 28, 2017
2,139 views
$S: R_1(A),R_2(B),W_2(A),W_3(C),R_4(C),R_3(A),W_3(B),R_4(A),W_2(B),W_4(B),W_3(A)$View serializable or not?