Scribd
Upload
34 views4 pages

Conflict Serializability

Conflict serializability ensures that the outcome of concurrent transactions is equivalent to a serial order, maintaining data dependencies. The document outlines conflicting operations and their dependencies between transactions, leading to the conclusion that the given schedule is conflict serializable due to the absence of cycles in the precedence graph. This concept is crucial in database management systems to ensure data integrity during concurrent transactions.

Uploaded by

premkannanmscds
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
34 views4 pages

Conflict Serializability

Conflict serializability ensures that the outcome of concurrent transactions is equivalent to a serial order, maintaining data dependencies. The document outlines conflicting operations and their dependencies between transactions, leading to the conclusion that the given schedule is conflict serializable due to the absence of cycles in the precedence graph. This concept is crucial in database management systems to ensure data integrity during concurrent transactions.

Uploaded by

premkannanmscds
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 4

DATABASE MANAGEMENT

SYSTEM

Dr. Mageshwari V
Assistant Professor
Department of Mathematics
Amrita Vishwa Vidyapeetham
Conflict Serializability
• Conflict serializability is a property of a schedule that guarantees that
the outcome of the concurrent transactions is equivalent to some
serial order of the same transactions.
• This means that the concurrent schedule does not violate any data
dependencies or constraints that would be enforced by the serial
order.
Conflict Serializability
 R2(X) , W3(X) (T2 → T3)

 R2(X) , W1(X) (T2 → T1)

 W3(X) , W1(X) (T3 → T1)

 W3(X) , R4(X) (T3 → T4)

 W1(X) , R4(X) (T1 → T4)

 W2(Y) , R4(Y) (T2 → T4)


Step-01:
List all the conflicting operations and determine the dependency between the transactions-
 R2(X) , W3(X) (T2 → T3)

 R2(X) , W1(X) (T2 → T1)

 W3(X) , W1(X) (T3 → T1)

 W3(X) , R4(X) (T3 → T4)

 W1(X) , R4(X) (T1 → T4)

 W2(Y) , R4(Y) (T2 → T4)


• Step-02:
Draw the precedence graph-
• Clearly, there exists no cycle in the precedence graph.

• Therefore, the given schedule S is conflict serializable.

You might also like