Serialisable schedules, Database Management System

Assignment Help:

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.


Related Discussions:- Serialisable schedules

Describe sequential file organization, Describe sequential file organizatio...

Describe sequential file organization.  Explain the rules for (i)  Inserting a new record. (ii)  Deleting an existing record.          Ans:A sequential f

Explain the disadvantages of a file processing system, Explain the disadvan...

Explain the disadvantages of a file processing system? Ans: Disadvantages of File Processing Systems include: 1) Data Redundancy 2) Data Inconsistency 3) Difficult to acce

Outer join, Outer Join: The use of Outer Join is that it still joins those...

Outer Join: The use of Outer Join is that it still joins those tuples that do not have matching values in common columns are also contained in the result table. Outer join places

Need point of sale software for pizza restaurant, Project Description: N...

Project Description: Need Point of Sale software for pizza restaurant. Delivery and take out service, client's database, inventory control, order history, last order, order from

What is meant by physical blocks, What is meant by Physical blocks? The...

What is meant by Physical blocks? The input and output operations are completed in block units. The blocks residing on the disk are referred to as physical blocks.

OLAP CUBES, 1) Define a job scheduling strategy that will meet business req...

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

Constraints violation during insertion, If the insertion violates one or mo...

If the insertion violates one or more constraints, then two alternatives are available: Default option: - Insertion can be discarded and the reason of refusal can also be ex

Represent the form as a relational schema, Question: This form represen...

Question: This form represents one of a number used for each sailing of a range of boats. A passenger may go on many sailings and will have the same passenger number for each.

Get details of employee working on both comp354 and comp345, Consider the r...

Consider the relations EMPLOYEE(emp#, name) ASSIGNED_TO(project#, emp#) PROJECT(project#, project_name, chief) Express the subsequent queries in Relational Algebra (i) Ge

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd