Schedule in DBMS

PratibhaRashmiSingh 1,585 views 14 slides Aug 28, 2020
Slide 1
Slide 1 of 14
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14

About This Presentation

What is Schedule? Serial Schedule, Non-Serial Schedule, Serializable Schedule


Slide Content

MCA, MSc(CS), PGDCA
PratibhaRashmi

Aschedulecontainsasetofinstruction
whichspecifytheorderoftheexecutionof
theinstructions.
Itcouldbethreetypes.
dbrau
Schedule
Serial Schedule
Non-Serial
Schedule
Serializable
Schedule

Theserialscheduleisatypeofschedulewhere
onetransactionisexecutedcompletelybefore
startinganothertransaction.
Aserialscheduledoesn’tallowconcurrency,only
onetransactionexecutesatatimeandtheother
startswhenthealreadyrunningtransactionstartswhenthealreadyrunningtransaction
finished.
IftherearetwotransactionsT1andT2
whichhavesomeoperations.Ifithasno
interleavingofoperations,thenthereare
thefollowingtwopossibleresults:

Execute all the operations of T1 which was
followed by all the operations of T2.
Here, Schedule A shows the serial schedule
where T1 followed by T2.

Execute all the operations of T2 which was
followed by all the operations of T1.
Here, Schedule A shows the serial schedule
where T2 followed by T1.

If interleaving of operations is allowed, then
there will be a non-serial schedule.
There are many possible orders in which the
system can execute the individual operations
of the transactions.of the transactions.
IftherearetwotransactionsT1andT2
whichhavesomeoperations.Ifithasno
interleavingofoperations,thenthereare
thefollowingtwopossibleresults:

Schedule C and Schedule D are the non-serial
schedules. Because It has interleaving of
operations.

A serializableschedule always leaves the
database in consistent state. Aserial
scheduleis always a serializableschedule.
However, a non-serial schedule needs to be
checked for Serializability.checked for Serializability.
A transaction schedule is serializableif its
outcome is equal to the outcome of its
transaction executing serially.

LetusconsiderI1andI2aretwoconsecutive
instructionsofT1andT2respectively.Boththe
instructionareoperatingonsamedataitemQ,these
instructionaresaidtobeconflictinginstructionifany
oneofthefollowinginstructionoccurs
simultaneously.
I1=read(Q)&I2=write(Q)I1=read(Q)&I2=write(Q)
I1=write(Q)&I2=read(Q)
I1=write(Q)&I2=write(Q)
Itmeansinboththeinstructiononeoperationis
writeoperationonthesamedataitemleadstothe
conflicts.
Conflictinginstructioncannotbeswap(interchange)
otherwisetheoperationoftheschedulewillbe
change.

Any execution of a set of transactions is
called as its ___________.
non-serial schedule
serial schedule
scheduleschedule
interleaved schedule
State true or false: If I = read(Q) and J =
read(Q) then the order of I and J does not
matter.
a) True
b) False

State true or false: If I = read(Q) and J =
write(Q) then the order of I and J does not
matter.
a) True
b) False
The _________is a type of schedule where one
transaction is executed completely before
starting another transaction.
a)serial schedule
b) non-serial schedule

What is scheduling in DBMS?
What is Schedule list the types of schedule?
What is serial schedule and serializableWhat is serial schedule and serializable
schedule?
What do you mean by conflict operations?

“Fundamentals of Database Systems” by R
Elmasriand S Navathe.
“An Introduction to Database Systems” by
BipinDesai
https://www. beginnersbook.com, https://www. beginnersbook.com,
http://Javapoint.com