Sonali Asked a Question
September 29, 2020 3:25 pmpts 20 pts
and T, Consider the following schedule for transactions T, 1 T2 T, Read(X Read (Y) Read(Y) Write(Y) e.com Write(X) Write(X) Read(X) Write(X) Which one of the schedules below is the correct serialization of the above? T,T T (C)T- T, -T, (B) T T,T (D) T,-»T, T (A) lo com 1 Call us: 7665435300 77
  • 1 Answer(s)
  • 0 Likes
  • 6 Comments
  • Shares
  • Mohit kaushik
    Prefer:
    • cropped6523714899057798994.jpg
    Likes(0) Reply(0)
  • Nabeela
    have you got the solution?
    Likes(0) Reply(0)
  • Sonali
    how can I draw the graph can u elaborate ?
    Likes(0) Reply(0)
  • Sonali
    how can I identify correct answer based on graph ?
    Likes(0) Reply(0)
  • Sonali
    which option is correct ?
    Likes(0) Reply(0)
  • Nabeela thankyou
    firs tmake the graph based on these transaction.. if it contains cycle then it is not conflict serializable else it is...if it is CS , then arrange them according to topological so...
    Show more
    Likes(0) Reply(1)
    Nabeela
    do you know how to make a graph to check CS