CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

View Serializability

Consider the ...

Question

Consider the schedule T1 : W(x), T2: R(x), T1 : W(x), then the schedule is

Open in App

Solution

(D)
Precedence graph for the schedule has a cycle from T1 - T2, and the schedule not satisfying the view rules then the schedule is said to be neither conflict nor view serializable.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider the schedule
S= T1 : R(x), T1: W(x), T2: R(Y): T2: W(Y), T1:R(Z), T1: W(Z), T2: R(X), T2: W(X)
If the schedule is to be cascadeless and recoverable the commit operation of T1 should appear

Q. Consider the schedule:
T1:R(X), T1: R(Y), T1:W(X), T2:R(Y), T3:W(Y), T1:W(X), T2:R(Y),
Identify the characteristics of above schedule.

Q. T1: R(X), T2:W(X), T1:W(X), T3: W(X), T1: commit, T2: commit, T3: commit. Identify the characteristics of above Schedule.

Q. Suppose a database schedule S which involves transactions T1, T2, ........, Tn. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

View Serializability

OTHER

Watch in App

explore_more_icon

Explore more

View Serializability

Join BYJU'S Learning Program

CrossIcon