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
Define a property that is not a property of transactions? Ans: Concurrency is not a property of transactions

Data Replication "If a relation R has its copies kept at two or more sites, then it is considered replicated". But why do we replicate a relation? There are several advan

1. Identify the comparisons and exchanges made to sort the following array using the selection exchange sort technique. Note: you may not need all columns. Ori

Depending upon the rules we have found, we can classify the locks into two types. Shared Lock: A transaction might be acquiring shared lock on a data item in order to read it

What is Data dictionary? A data dictionary is a reserved space in a database that is employed to store information about the database itself. A data dictionary may consist o

This project requires you to perform a systems analysis and then design a system solution using database software. Ace Auto Dealers specializes in selling new vehicles from Subaru.

Define Shared locks? Ans: Shared lock: Throughout concurrent execution of transactions, earlier than a transaction can access a data item, it has to obtain a lock on it. Now he

Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?


Describe briefly models which define the operations on classes. The three models which are used to define operations on classes are as: Object Model = data dictionary + Obje