Scribd
Upload
35 views2 pages

3 Schedules

The document discusses transaction concepts in database management, focusing on ACID properties, schedules, and concurrency control. It defines serial and non-serial schedules, explaining how transactions can be executed either sequentially or with interleaving operations. Additionally, it covers the concept of serializability, which ensures that non-serial schedules produce the same results as their serial counterparts.

Uploaded by

Aruna A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views2 pages

3 Schedules

The document discusses transaction concepts in database management, focusing on ACID properties, schedules, and concurrency control. It defines serial and non-serial schedules, explaining how transactions can be executed either sequentially or with interleaving operations. Additionally, it covers the concept of serializability, which ensures that non-serial schedules produce the same results as their serial counterparts.

Uploaded by

Aruna A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SNS COLLEGE OF TECHNOLOGY

(An Autonomous Institution)


Approved by AICTE, New Delhi, Affiliated to Anna University, Chennai
Accredited by NAAC-UGC with ‘A++’ Grade (Cycle III) &
Accredited by NBA (B.E - CSE, EEE, ECE, Mech & B.Tech.IT)
COIMBATORE-641 035, TAMIL NADU

UNIT IV - Transaction
Transaction Concepts – ACID Properties – Schedules – Serializability – Concurrency
Control – Need for Concurrency – Locking Protocols – Two Phase Locking – Deadlock –
Transaction Recovery – Save Points – Isolation Levels – SQL Facilities for Concurrency and
Recovery.
Schedules

A series of operation from one transaction to another transaction is known as schedule.


It is used to preserve the order of the operation in each of the individual transaction.

Serial Schedule
The serial schedule is a type of schedule where one transaction is executed completely
before starting another transaction. In the serial schedule, when the first transaction
completes its cycle, then the next transaction is executed.

Ms A Aruna / AP/ IT/23CST201 Database Management Systems/ Semester 04/Unit 4 Page 1 of 2


For example: Suppose there are two transactions T1 and T2 which have some operations.
If it has no interleaving of operations, then there are the following two possible outcomes:
 Execute all the operations of T1 which was followed by all the operations of T2.
 Execute all the operations of T1 which was followed by all the operations of T2.
 In the given (a) figure, Schedule A shows the serial schedule where T1 followed by
T2.
 In the given (b) figure, Schedule B shows the serial schedule where T2 followed by
T1.
Non Serial Schedule
 If interleaving of operations is allowed, then there will be non-serial schedule.
 It contains many possible orders in which the system can execute the individual
operations of the transactions.
 In the given figure (c) and (d), Schedule C and Schedule D are the non-serial
schedules. It has interleaving of operations.

Serializable schedule
 The serializability of schedules is used to find non-serial schedules that allow the
transaction to execute concurrently without interfering with one another.
 It identifies which schedules are correct when executions of the transaction have
interleaving of their operations.
 A non-serial schedule will be serializable if its result is equal to the result of its
transactions executed serially.

Ms A Aruna / AP/ IT/23CST201 Database Management Systems/ Semester 04/Unit 4 Page 2 of 2

You might also like