Question

Consider the following schedule that performs actions taken by transactions 71 and T2 on database objects A and B: T1: R(A),

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Correct Answer:

Explanation:

The given schedule is:

T2 T1 R(A) WCA) R(C) R(B) W(B) Commit W(B) Commit

A schedule is known as a cascade-less schedule in which there is no dirty read. If the dirty read is present then the schedule is not cascade-less.

If a transaction reads data written by uncommitted transaction then this read operation is known as dirty read.

Cascading abort means the failure of one transaction leads to the rollback of the series of transactions.

If a schedule is cascade-less if it avoids cascading abort.

This schedule is cascade-less because there is no dirty bit.

Option A is incorrect because this schedule doesn't result in cascading aborts.

Option B is incorrect because there is no write-read conflict.

Option C is correct because this schedule results in a write-write conflict.

Option D is incorrect because there is no read-write conflict.

So, option C is correct.

Add a comment
Know the answer?
Add Answer to:
Consider the following schedule that performs actions taken by transactions 71 and T2 on database objects...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Consider the following schedule that performs actions taken by transactions T1 and T2 on database objects...

    Consider the following schedule that performs actions taken by transactions T1 and T2 on database objects A and B :                 T1: S(A), R(A), X(B), U(A),  R(B),W(B), Commit: U(B)                 T2: S(B), R(B), X(A), U(B), R(A), W(A), Commit:  U(A)                             Because Strict 2PL is using, this schedule is guaranteed to be conflict serializable. A: True B:False

  • Consider the following schedule. The actions are prefixed with the transaction name and are listed in...

    Consider the following schedule. The actions are prefixed with the transaction name and are listed in the order they’re scheduled. S: T2:R(Y), T1:R(X), T1:W(X), T3:R(Y), T3:W(X), T1:W(Z), T2:R(X), T3:R(Z) a. Draw the dependency graph for S. b. Is S serializable? c. Is S conflict serializable? If so, what is the conflict equivalent serial schedule?

  • -Advanced Database- Consider the following transaction schedule, where time increases from top to bottom. T1 T2...

    -Advanced Database- Consider the following transaction schedule, where time increases from top to bottom. T1 T2 T3 T4 Read (X) Read(Y) Read(Z) Read(Y) Write(Y) Write(Z) Read(U) Read(Y) Write(Y) Read(Z) Write(Z) Read(U) Write(U) Answer the following questions: Draw the precedence graph of the above schedule. Is this schedule conflict serializable? If yes, show what serial schedule(s) it is equivalent to. If not, explain why. Is this schedule view serializable? If yes, show what serial schedule(s) it is equivalent to. If not,...

  • For the system given in figure 3 identify if schedule 2 is conflict equivalent and view...

    For the system given in figure 3 identify if schedule 2 is conflict equivalent and view equivalent to schedule 1. Give proper reasons for you answer. Resolve the issues in schedule 2 by adopting appropriate locking scheme and apply deadlock prevention scheme to ensure prevention of deadlocks and starvation. (7) Table 2:Serial Schedule 1 T1   T2   T3   T4   T5                Read(X)                Read(Z)                Read(Y)                Write(Z)   ...

  • Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions...

    Q5: In DBMS, a graph precedence is used to test whether a schedule of concurrent transactions is conflict serializable or not. Given the following schedule S with three transactions T T3 T2 read(A) read(B) write(A) read(A) write(B) write(A) read(B) write(B) 1. Draw the precedence graph for the schedule S (5 points) 2. Check whether the schedule S conflict serializable or not (5 points] 3. Is it possible to construct a serial schedule S'which is conflict equivalent to the schedule S?...

  • Four transactions are presently running: (The abbreviation R(A) means Read(A), and so on) • T1: R(A),R(B),R(J),W(A),W(B),R(D),R(E),R(G)...

    Four transactions are presently running: (The abbreviation R(A) means Read(A), and so on) • T1: R(A),R(B),R(J),W(A),W(B),R(D),R(E),R(G) • T2: R(C),R(G),W(C),R(H),W(H),R(D) • T3: W(J),R(C),W(C) • T4: R(G),W(D),R(J) The following is a schedule for these transactions. T1:R(A), T4:R(G), T3:W(J), T1:R(B), T1:R(J), T1:W(A), T3:R(C), T3:W(C), T2:R(C), T2:R(G), T1:W(B), T1:R(D), T2:W(C), T1:R(E), T1:R(G), T2:R(H), T2:W(H), T4:W(D), T4:R(J), T2:R(D) 1. List all conflicts in these transactions. 2. Is the schedule conflict serializable? If it is, to which serial schedule(s) is it equivalent?

  • You are given with the following schedule, that consists of three transactions (T1, T2, T3) and...

    You are given with the following schedule, that consists of three transactions (T1, T2, T3) and three database elements (A, B and C) w3(A); r1(A); w1(B); r2(B); w2(C); r3(C) a) Identify all the conflicts (as defined in Section 18.2.1 in the book). Hint: draw a bipartite graph between transactions and elements, as done in class b) Draw a precedence graph (as defined in Section 18.2.2 in the book). Is the schedule conflictserializable? Justify your answer

  • SQL question Consider the three transactions T1, T2 and T3, and the schedules S1, S2, S3...

    SQL question Consider the three transactions T1, T2 and T3, and the schedules S1, S2, S3 and S4 given below. Which of the schedules is (conflict) serializable? The subscript for each database operation in a schedule denotes the transaction number for that operation. For each schedule, show all conflicts, draw the precedence graph, determine and write down if it is serializable or not, and the equivalent serial schedules if exist. T1: r1(x); w1(x); T2: r2(x); T3: r3(x); w3(x); S1: r1(x);...

  • 1. What is the difference between Two-Phase Locking (2PL) and Strict Two-Phase Locking? What condition to Strict 2PL prevent that 2PL does not prevent? 2. What are deadlocks? What are two techniques...

    1. What is the difference between Two-Phase Locking (2PL) and Strict Two-Phase Locking? What condition to Strict 2PL prevent that 2PL does not prevent? 2. What are deadlocks? What are two techniques for detecting and resolving deadlocks? 3. In the figure below, R(X, y) means read database item X into variable y and W(X, y) means write variable y into database item y. Column T1 shows transaction T1's operations and column T2 shows T2's operations. Columns Aand_B show the values...

  • Consider the following protocol for concurrency control. The database system assigns each transaction a unique and...

    Consider the following protocol for concurrency control. The database system assigns each transaction a unique and strictly increasingly id at the start of the transaction. For each dataitem, the database system also keeps the id of the last transaction that has modified the data item, called the transaction-id of the data item. Before a transaction T wants to read or write on a data item A, the database system checks whether the transaction-id of A is greater than the id...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT