1,207 views
0 votes
0 votes

i) Is this schedule conflict serializable?

ii)is this scheule view serializable?

ii) Is this schedule serializable??

HOW TO SOLVE THIS PROBLEM?

1 Answer

0 votes
0 votes

1) CONFLICT SERIALIZABLE.

$R_{i}(A)-W_{j} (A)$  

$W_{i}(A)-W_{j} (A)$  

$W_{i}(A)-R_{j} (A)$ //then there is edge between Ti and Tj.

if precedence graph contains loop ,it is not conflict serializable.

predendece graph edge exist between $W_{1}(A)-R_{2} (A)$ and $R_{2}(B)-W_{1} (B)$ .so loop formed no conflict seralizable.

2)VIEW SERIALIZABLE.  (skips W-W problem)

 $R_{i}(A)-W_{j} (A)$  

$W_{i}(A)-R_{j} (A)$ //then there is edge between Ti and Tj.

if no loop it is view serializable.schdeule is not view serializable.  $W_{1}(A)-R_{2} (A)$ and $R_{2}(B)-W_{1} (B)$   loop formed.

3)SERIALIZABLE.i)initial reads should be same.

                         ii)updated reads should be same.

                        iii)final writes should be same.

in transaction T2 reads a data item "A' which is updated by T1.so intial reads are not same.

not serializable.

Related questions

1 votes
1 votes
3 answers
1
learncp asked Sep 18, 2015
1,486 views
Suppose we have a schedule containing two transactions  as shown-$\begin{bmatrix} T1 & T2 \\ R(A) & \\ W(A) & \\ & R(A) \\  & W(A) \\ R(B)& \\ W(B)& \\ & R(B) \\  & W(...
0 votes
0 votes
1 answer
2
sh!va asked Feb 10, 2017
369 views
T1T2READ-Q WRITE-P WRITE-QREAD-P Given schedule is:a) Not conflct serializable, but view serializableb) conflct serializable, not view serializablec) Both conflct seria...
0 votes
0 votes
2 answers
4
sh!va asked Dec 1, 2016
492 views
i) Is this schedule conflict serializable?ii)is this scheule view serializable?ii) Is this schedule serializable??