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 data dictionary, What is Data dictionary? A data dictionary is ...

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

Benefits abd drawback of hashed file organisation, Benefits of Hashed file ...

Benefits of Hashed file Organisation 1.      Insertion or search on hash-key is quick. 2.      Best if equality search is required on hash-key. Drawbacks of Hashed file

A file manipulation command that extracts some records, A file manipulation...

A file manipulation command that extracts some of the records from a file is called ? A file manipulation command that extracts some of the records from a file is called SELECT

Insertion anomaly-data redundancy, Insertion Anomaly: Inability to show ce...

Insertion Anomaly: Inability to show certain information-The primary key of the over relation be (enrolment number, Cno). Any new tuple to be inserted in the relation should have

Illustrate the fifth normal form, Fifth Normal Form (5NF) These relatio...

Fifth Normal Form (5NF) These relations still have a difficulty. While defining the 4NF we mentioned that all the attributes depend upon each other. Whereas creating the two ta

Normalization, Process of normalization is the integral part of designing a...

Process of normalization is the integral part of designing a database. Justify this statement with suitable database design

Explain equivalent relational schema, Question: (a) Use the following b...

Question: (a) Use the following business rules to produce the E-R diagram. You should clearly show all the minimum and maximum cardinality constraint on each side of the relati

Example of ancestry database , Ancestry database records information about ...

Ancestry database records information about family trees . Following information is recorded about each person: FIRSTNAME first name SURNAME surname MNAME maiden name (if

Where and having clause in sql, WHERE and HAVING clause in SQL ? The WH...

WHERE and HAVING clause in SQL ? The WHERE clause is commonly used for implementing conditions on each tuple of the relation. The HAVING clause is used in combination along wi

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