Serialisable schedules, Database Management System

Serialisable Schedules:If the processes of two transactions conflict with each other, how to verify that no concurrency related problems have happened? For this, serialisability theory has been developed. Serialisability theory attempts to verify the correctness of the schedules. The rule of this theory is:

"A schedule S of n transactions is serialisable if it is equal to some serial schedule of the similar 'n' transactions".

A serial schedule is a schedule in which either transaction T1 is totally done before T2 or transaction T2  is totally done before T1. For instance, the following figure clears the two possible serial schedules of transactions T1  & T2.

Schedule A: T2 followed by T1

Schedule B: T1 followed by T2

Schedule

T1

T2

Schedule

T1

T2

Read X

 

Read X

Read X

Read X

 

Read Y

 

Read Y

Subtract 100

Subtract 100

 

Display X+Y

 

Display X+Y

Write X

Write X

 

Read X

Read X

 

Read Y

Read Y

 

Subtract 100

Subtract 100

 

Add 100

Add 100

 

Write X

Write X

 

Write Y

Write Y

 

Read Y

Read Y

 

Read X

 

Read X

Add 100

Add 100

 

Read Y

 

Read Y

Write Y

Write Y

 

Display X+Y

 

Display X+Y

                                                                         Figure: Serial Schedule of two transactions

Schedule C: An Interleaved Schedule

Schedule

T1

T2

Read X

Read X

 

Subtract 100

Subtract 100

 

Read X

 

Read X

Write X

Write X

 

Read Y

 

Read Y

Read Y

Read Y

 

Add 100

Add 100

 

Display X+Y

 

Display X+Y

Write Y

Write Y

 

                                                                           Figure: An Interleaved Schedule

Now, we have to figure out whether this interleaved schedule would be performing read and write in the same order as that of a serial schedule. If it does, then it is equivalent to a serial schedule, otherwise not. In case it is not equivalent to a serial schedule, then it may result in problems due to concurrent transactions.

Posted Date: 3/12/2013 2:00:21 AM | Location : United States







Related Discussions:- Serialisable schedules, Assignment Help, Ask Question on Serialisable schedules, Get Answer, Expert's Help, Serialisable schedules Discussions

Write discussion on Serialisable schedules
Your posts are moderated
Related Questions
Foreign Keys and NULL Let us take the relation:                 DEPT DEPT ID DNAME BUDGET D1 M

what is lossless & dependency preserving decomposition ?

Lack of Redundancy We have talked about the problems of repetition of information in a database. Such repetition should be stay away as much as possible. Let us state once again t

Describe entity referential integrity and integrity. Give an example of each. Entity Integrity Rule - If there is a attribute A of relation R is a prime attribute of R then A

I am going to develop a web site to present decision tree structure. For this, I want a web application with AJAX technology to connect the database and prepare the decision tree's

Given the following relations Vehicle (Reg_no, make, colour) Person(eno, name, address) Owner(eno, reg_no) Write expressions in the relational algebra to answer the following

1. Design the logic, using a looping structure, for a program that outputs every even number from 1 through 25 along with its square and cube. 2. Mr. Sanchez owns 12 apartme

Which is another name for weak entity? Child is another name of weak entity.

Differentiate between Procedural and non procedural languages ? Procedural and non procedural languages - A procedural language specifies the operations to be performed on th

Product adder required for Ecommerce website Project Description: Want a product adder for 500 products I have a magento website and need products pulled from site A to my si