0% found this document useful (0 votes)
19 views

Serial Iz Ability

Uploaded by

Palak Rathore
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
0% found this document useful (0 votes)
19 views

Serial Iz Ability

Uploaded by

Palak Rathore
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/ 3

What is Serializability?

Serializability is the process of search for a concurrent schedule who output is


equal to a serial schedule where transaction are execute one after the other. When
multiple transactions are being executed by the operating system in a
multiprogramming environment, there are possibilities that instructions of one
transaction are interleaved with some other transaction. Depending on the type of
schedules, there are two types of serializability:

 Conflict

 View

Conflict Serializability in DBMS


As discussed in Concurrency control, serial schedules have less resource

utilization and low throughput. To improve it, two or more transactions are run

concurrently. But concurrency of transactions may lead to inconsistency in

database. To avoid this, we need to check whether these concurrent schedules are

serializable or not.

Conflict Serializable: A schedule is called conflict serializable if it can be

transformed into a serial schedule by swapping non-conflicting operations.


Conflicting operations: Two operations are said to be conflicting if all

conditions satisfy:

 They belong to different transactions

 They operate on the same data item

 At Least one of them is a write operation

View Serializability in DBMS

o A schedule will view serializable if it is view equivalent to a serial schedule.

o If a schedule is conflict serializable, then it will be view serializable.

o The view serializable which does not conflict serializable contains blind

writes.

Difference between Conflict and View Serializability

Serializable Schedule:
A transaction schedule is serializable if its outcome is equal to the outcome of its

transactions executed serially i.e. sequentially without overlapping in time. A

serializable schedule always leaves the database in consistent state. A serial

schedule is always a serializable schedule because a new transaction only starts

when the older one has finished execution.


Types of Serializable Schedules:
1. Result Equivalent Schedule
2. Conflict Equivalent Schedule or Conflict Serializability
3. View Equivalent Schedule or View Serializability

Difference between Conflict and View Serializability:

Conflict Serializability View Serializability

Two schedules are said to be conflict equivalent if Two schedules are said to be view equivalent if the
all the conflicting operations in both the schedule order of initial read, final write and update operations
get executed in the same order. If a schedule is a is the same in both the schedules. If a schedule is
conflict equivalent to its serial schedule then it is view equivalent to its serial schedule then it is called
called Conflict Serializable Schedule. View Serializable Schedule.

If a schedule is view serializable then it may or may If a schedule is conflict serializable then it is also
not be conflict serializable. view serializable schedule.

View equivalence is rather difficult to achieve as


Conflict equivalence can be easily achieved by both transactions should perform similar actions in a
reordering the operations of two transactions similar manner. Thus, View Serializability is difficult
therefore, Conflict Serializability is easy to achieve. to achieve.

If a transaction T1 writes a value A that no other


For a transaction T1 writing a value A that no one transaction reads (because later some other
else reads but later some other transactions say T2 transactions say T2 writes its own value of A) W(A)
write its own value of A, W(A) cannot be placed can be placed in positions of the schedule where it is
under positions where it is never read. never read.

You might also like