Presentation on:

Concurrency Control Based On Time Stamping

Submitted By: Submitted To:

Poojitha G L : 4GM21CS067 Dr. Maheswari L Patil
Ranjita U Kummur: 4GM21CS082 Associate Professor

Sanjana V Jadhav : 4GM21CS094 CSE Department

Shreya NMH : 4GM21CS100 GMIT, Davangere.
Concurrency Control in
Database Systems
Understanding concurrency control is essential for maintaining data integrity in
database systems. This presentation dives into the mechanisms of locking and
timestamp ordering, exploring how they ensure serializability and address
challenges such as deadlocks and rollbacks.
Locking and 2PL Protocol
1 Locking Mechanism
Locking is a fundamental concept in database concurrency control, used to manage
simultaneous transaction executions and maintain data integrity.

2 2PL Protocol
The Two-Phase Locking (2PL) protocol ensures that the schedules are serializable
and that transactions occur in a controlled manner.

3 Handling Deadlocks
While effective, the 2PL protocol can lead to deadlocks, requiring transactions to be
aborted and restarted to resolve conflicts.
Timestamps
Timestamps
Timestamps serve as unique
identifiers for transactions,
assigned in the order of
transaction submissions, and are
crucial for timestamp-based
concurrency control.
Deadlock Avoidance
Unlike locking mechanisms,
timestamp ordering does not use
locks, thereby eliminating the
possibility of deadlocks.
Timestamp Generation
Timestamps can be generated
using a counter or the system
clock, ensuring each transaction
has a distinct timestamp.
The Timestamp Ordering Algorithm for Concurrency Contr

Read and Write Operation Checks Conflict Serializable

Timestamps
Each database item is
associated with a read and write
timestamp, reflecting the latest
transactions that have accessed
the item.
The algorithm performs checks
to ensure that conflicting
operations adhere to the
timestamp order, aborting
transactions if necessary.
Schedules
By following the timestamp
order, the algorithm guarantees
that the schedules produced are
conflict serializable.
Basic Timestamp Ordering (TO)
1 Read/Write Operations
Transactions issue read or write
operations, which are checked against
item timestamps to maintain order.
2 Cascading Rollback
Transactions may be rolled back in a
cascade if they depend on the operations
of aborted transactions, highlighting a
challenge of basic TO.

3 Recoverability Protocols
To ensure recoverability, additional protocols are applied to the basic TO algorithm,
preventing non-recoverable schedules.
Strict Timestamp Ordering (STO)
Strict Schedules
Strict Timestamp Ordering (STO) variation
ensures schedules are strict, aiding in
easier recoverability.
Delaying Operations
Operations are delayed until the relevant
transactions have committed or aborted,
ensuring order and recoverability.

Lock Simulation
STO simulates the locking of items to manage access until transactions are resolved, without
causing deadlocks.
Thomas's Write Rule

1 2 3
Abort Ignore Execute
If a read timestamp is greater than If a write timestamp is greater, the When conditions allow, the write
the transaction's timestamp, the write operation is ignored to avoid operation is executed and the
transaction is aborted. outdated operations. write timestamp is updated.