Transaction Schedules in DBMS

Schedules in DBMS, Schedules example, Define schedule, Explain schedules with examples, Definitions of schedules

Schedule

A schedule is a list of operations (read, write, commit, abort, checkpoint, calculation – we mostly consider the read and write operations) that are performed by various concurrently (simultaneous) executing set of transactions. The chronological order of the individual transactions’ instructions must be preserved in a schedule.

When two or more transactions are executing simultaneously, then the steps involved in the transactions are usually interleaved. That means, first few instructions executed from T1 and then from T2, then back to T1 etc. until both T1 and T2 are finished (if only T1 and T2 are executing at that time, for example).

The instructions are interleaved in a schedule because, if one transaction is processing some I/O with disk, the other transactions may use the CPU. They do not need to wait until one transaction completes its execution. This concurrent access improves both the response time and the number of transaction that can be completed in a given time.

Example:

Schedule 1

Transaction T1 Transaction T2 read(A); A := A – 5; write(A); read(B); B := B – 5; write(B); read(A); temp := A * 0.1; A := A – temp; write(A); read(B); B := B + temp; write(B);

In schedule 1, first three instructions of T1 are executed first then the first four instructions of T2 are executed. Again, the next three instructions of T1 are executed then the next three instructions of T2 executed. This happens in coordination with time.

Schedule 2

Transaction T1 Transaction T2 Transaction T3 read(A); A := A – 5; write(A); read(B); B := B + 5; write(B); read(A); temp := A * 0.1; A := A – temp; write(A); read(B); B := B + temp; write(B); read(C); temp1 := C * 0.5; C := C + temp1; write(C); read(D); temp2 := D * 0.5; D := D + temp1; write(D);

In schedule 2, three instructions T1, T2 and T3 are executed in an interleaved fashion. Here, the execution order is T3àT1àT2àT3àT1àT2.

Other definitions:

• When transactions are executing concurrently in an interleaved fashion, then the order of execution of operations from all the various transactions is known as a schedule (or history) – Fundamentals of Database Systems by Elmasri and Navathe.

• A schedule is a list of actions (reading, writing, aborting, or committing) from a set of transactions, and the order in which two actions of a transaction T appear in a schedule must be the same as the order in which they appear in T – Database Management Systems by Raghu Ramakrishnan and Gehrke.

• A particular sequencing (usually interleaved) of the actions (reading and writing) of a set of transations is called a schedule (or history). The order of actions of every transaction in a schedule must always be the same as they appear in the transaction – Database Management Systems by G K Gupta.

*******************

Go to Transaction Management in DBMS home page