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

What is the concept of knowledge discovery in database, Data Warehousing & ...

Data Warehousing & Mining 1. What is the concept of knowledge discovery in database? 2. Describe the following types of Multidimensional Data Models. • Stars, Snowflakes and

Difference between functions along with or without grouping, Explain the di...

Explain the difference between using functions along with and without grouping attributes in relational algebra. Give examples. Ans: Group functions are used to group data of

Assignment, Birla Institute of Technology & Science, Pilani Work-Integrated...

Birla Institute of Technology & Science, Pilani Work-Integrated Learning Programmes Division Second Semester 2012-2013 EC-1 Assignment 2 (7.5% of the grade) Course No. : SS ZG

Express types of information available in mysql, Express types of informati...

Express types of information available in MySQL? Information as regards the result of queries:  This includes number of records affected by any SELECT or UPDATE or DELETE st

Keys, it can be possible to create any table without primary key

it can be possible to create any table without primary key

Convert encrypted hsql database into csv format, Project Description: We...

Project Description: We have an encrypted HSQL Database which we want to change into csv format. HSQL DB . We have java application (jar file) which reads that database but n

Define rotational latency time, Define rotational latency time. The ti...

Define rotational latency time. The time spent waiting for the sector to be accessed to appear under the head is known as the rotational latency time.

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

Using relational algebra which query finds customers, Using Relational Alge...

Using Relational Algebra which query finds customers, who have a balance of over 1000 ? Using Relational Algebra Π Customer_name( σ balance >1000(Deposit)) is query to find cu

Give a sample of the dynamic model, Give a sample of the Dynamic Model. ...

Give a sample of the Dynamic Model. The sample of dynamic model is given below:  Dynamic model for the car: Brake and Accelerator            Brake or Applies Accelerator

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