[go: up one dir, main page]
Scribd
Upload
107 views5 pages

10 - Timestamp Based Concurrency Control

The document discusses timestamp-based concurrency control. It describes how timestamps are assigned to transactions in the order they enter the system. The timestamp ordering protocol orders transactions based on their timestamps to ensure serializability. It uses read and write timestamps for each data item and aborts transactions that violate the timestamp order for conflicting read and write operations. One drawback is that cascading rollbacks are still possible.

Uploaded by

Ecell Farewell
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
107 views5 pages

10 - Timestamp Based Concurrency Control

The document discusses timestamp-based concurrency control. It describes how timestamps are assigned to transactions in the order they enter the system. The timestamp ordering protocol orders transactions based on their timestamps to ensure serializability. It uses read and write timestamps for each data item and aborts transactions that violate the timestamp order for conflicting read and write operations. One drawback is that cascading rollbacks are still possible.

Uploaded by

Ecell Farewell
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/ 5

Problems  345  

Courses

Timestamp based
Job Fair Live
Concurrency Control
Contests 

Concurrency Control can be implemented in different


 POTD
ways. One way to implement it is by using Locks. Now,
let us discuss Time Stamp Ordering Protocol.

As earlier introduced, Timestamp is a unique


identifier created by the DBMS to identify a
transaction. They are usually assigned in the order in
which they are submitted to the system. Refer to the
timestamp of a transaction T as TS(T). For the basics
of Timestamp, you may refer here.

Timestamp Ordering Protocol -


The main idea for this protocol is to order the
transactions based on their Timestamps. A schedule
in which the transactions participate is then
serializable and the only equivalent serial schedule
permitted has the transactions in the order of their
Timestamp Values. Stating simply, the schedule is
equivalent to the particular Serial Order
corresponding to the order of the Transaction
timestamps. An algorithm must ensure that, for each
item accessed by Conflicting Operations in the
schedule, the order in which the item is accessed
does not violate the ordering. To ensure this, use two
Timestamp Values relating to each database item X.

Menu
W_TS(X) is the largest timestamp of any
transaction that executed write(X) successfully.
:
R_TS(X) is the largest timestamp of any
transaction that executed read(X) successfully.

Basic Timestamp Ordering -


Every transaction is issued a timestamp based on
when it enters the system. Suppose, if an old
transaction Ti has timestamp TS(Ti), a new
transaction Tj is assigned timestamp TS(Tj) such that
TS(Ti) < TS(Tj). The protocol manages concurrent
execution such that the timestamps determine the
serializability order. The timestamp ordering protocol
ensures that any conflicting read and write
operations are executed in timestamp order.
Whenever some Transaction T tries to issue a
R_item(X) or a W_item(X), the Basic TO algorithm
compares the timestamp of T with R_TS(X) &
W_TS(X) to ensure that the Timestamp order is not
violated. This describes the Basic TO protocol in the
following two cases.

1. Whenever a Transaction T issues a W_item(X)


operation, check the following conditions:

If R_TS(X) > TS(T) or if W_TS(X) > TS(T),


then abort and rollback T and reject the
operation. else,
Execute W_item(X) operation of T and set
W_TS(X) to TS(T).
2. Whenever a Transaction T issues a R_item(X)
operation, check the following conditions:

If W_TS(X) > TS(T), then abort and reject T


and reject the operation, else
If W_TS(X) <= TS(T), then execute the
R_item(X) operation of T and set R_TS(X)
:
to the larger of TS(T) and current R_TS(X).

Whenever the Basic TO algorithm detects two


conflicting operations that occur in an incorrect order,
it rejects the latter of the two operations by aborting
the Transaction that issued it. Schedules produced by
Basic TO are guaranteed to be conflict serializable.
Already discussed that using Timestamp can ensure
that our schedule will be deadlock free.

One drawback of the Basic TO protocol is that


Cascading Rollback is still possible. Suppose we have
a Transaction T1 and T2 has used a value written by T1.
If T1 is aborted and resubmitted to the system then, T
must also be aborted and rolled back. So the problem
of Cascading aborts still prevails.

Let's gist the Advantages and Disadvantages of Basic


TO protocol:

Timestamp Ordering protocol ensures


serializability since the precedence graph will
be of the form:
:
Image - Precedence Graph for TS ordering

Timestamp protocol ensures freedom from


deadlock as no transaction ever waits.
But the schedule may not be cascade free, and
may not even be recoverable.

Strict Timestamp Ordering -


A variation of Basic TO is called Strict TO ensures that
the schedules are both Strict and Conflict
Serializable. In this variation, a Transaction T that
issues a R_item(X) or W_item(X) such that TS(T) >
W_TS(X) has its read or write operation delayed until
the Transaction T' that wrote the values of X has
committed or aborted.

Related GATE Questions -

1. GATE | GATE CS 2010 | Question 20


2. GATE | GATE-CS-2017 (Set 1) | Question 46
3. GATE | GATE-IT-2004 | Question 21

 Report An Issue

If you are facing any issue on this page. Please let us know.
:
:

You might also like