The Gateway to Computer Science Excellence
0 votes
157 views

how many view equivalent schedules are possible for the Sch given below:

in Databases by Active (1.3k points) | 157 views
0
only serial schedules or both serial and non serial?
0
serial
0
if only

serial then 6
0
Will you please mention those 6 serial schedules
+2
1234

1324

2134

2314

3124

3214
0
Thanks it helped :)
+1
T1 T2 T3 T4,

T2 T1 T3 T4,

T1 T3 T2 T4,

T2 T3 T1 T4,

T3 T1 T2 T4,

T3 T2 T1 T4
0
What if we replace W(B) in all transactions with W(A)?
0
then only 2 would be possible

1234 and 1324
0
Then 2 view equivalent schdule.

1) t1 t2 t3 t4,

2)t1 t3 t2 t4
0

I think the Schedule will not be View Serial as their will be no Blind Read isn't it

0

@Nandkishor3939 what is the actual answer given for above problem?

0
There will be no View equivalent schedule if all W(B) are replaced with W(A)
0

Its a self doubt question BTW, for the given question the answer should be 6

1 Answer

0 votes

polygraph for the given schedule: (View serializable)

$T_{0}$$\overset{A}{\rightarrow}$ $T_{1}$

$T_{0}$$\overset{A}{\rightarrow}$ $T_{2}$

$T_{0}$$\overset{A}{\rightarrow}$ $T_{3}$

$T_{0}$$\overset{A}{\rightarrow}$ $T_{4}$

$T_{4}$$\overset{B}{\rightarrow}$ $T_{f}$

$T_{1}$ $\rightarrow$$T_{4}$

$T_{2}$ $\rightarrow$$T_{4}$

$T_{3}$ $\rightarrow$$T_{4}$

 

 

($T_{1}T_{2}T_{3}$) $\,!$ $\rightarrow$$T_{4}$

$\therefore$ Total 6 cases

by Active (4.2k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,321 answers
198,391 comments
105,142 users