TIME STAMPING

PROTOCOL FOR
CONCURRENCY CONTROL
BY. SONAL BALIYAN
INTRODUCTION
Overview of Concurrency Control:
• Concurrency control is a database management technique
to ensure that multiple transactions can occur concurrently
without leading to inconsistencies.
• It is essential for maintaining data integrity and
consistency in multi-user environments.

Importance of Consistency:
• Prevents data anomalies and ensures reliable transaction
processing.
• Guarantees that database operations are performed
correctly even when multiple transactions are executed
simultaneously.
WHAT IS TIME STAMPING
PROTOCOL?
DEFINITION:
• TIME STAMPING PROTOCOL IS A CONCURRENCY CONTROL METHOD
THAT ASSIGNS A UNIQUE TIMESTAMP TO EACH TRANSACTION.
• TRANSACTIONS ARE ORDERED BASED ON THEIR TIMESTAMPS TO
MAINTAIN SERIALIZABILITY.

PURPOSE:
• To ensure that the execution of transactions preserves the consistency of the database.
• To provide a systematic way to manage read and write operations.

Key Concepts:
• Timestamps: Unique identifiers that represent the time when a transaction was initiated.
• Transactions: Sequences of operations (reads and writes) performed on the database.
• Read and Write Operations: Actions performed by transactions to access or modify the
database.
TYPES OF TIMESTAMPS
LOGICAL TIMESTAMPS:
• Represent the logical sequence of transactions.
• Often implemented using counters or logical clocks.

Physical Timestamps:
• Based on actual clock times.
• Use system clock to assign timestamps.

Generation of Timestamps:
• Timestamps are generated at the start of each transaction.
• Ensure uniqueness and maintain order.
BASIC RULES OF TIME STAMPING
PROTOCOL
TRANSACTION ORDERING:
• Transactions are ordered based on their timestamps.
• Ensures that older transactions get priority over newer ones.

Read Rule:
• A transaction T can read a data item X only if T's timestamp is
greater than the timestamp of the last transaction that wrote X.

Write Rule:
• A transaction T can write a data item X only if T's timestamp is
greater than the timestamp of the last transaction that read or
wrote X.

Example:
• If transaction T1 with timestamp 5 reads data item A, then
transaction T2 with timestamp 6 can only read A if it hasn’t been
written by any transaction with a timestamp less than 6.
TIMESTAMP ORDERING
PROTOCOL
EXPLANATION:
• The timestamp ordering protocol ensures that all conflicting read
and write operations are executed in the order of their
timestamps.
• This protocol helps maintain serializability by ordering
transactions based on their timestamps.

Mechanism:
• Each transaction is assigned a timestamp when it starts.
• Transactions are ordered based on their timestamps, ensuring that
the earlier transactions get higher priority.

Advantages and Disadvantages:

• Advantages: Simple to implement, prevents deadlocks, ensures
serializability.
• Disadvantages: Can lead to starvation of long-running
transactions, increased overhead due to timestamp management.
EXAMPLE SCENARIO:
TIMESTAMP ORDERING
PROTOCOL
SCENARIO:
• CONSIDER TWO TRANSACTIONS, T1 AND T2,
WITH TIMESTAMPS TS(T1) = 5 AND TS(T2) = 8.
• DATA ITEM A IS ACCESSED BY BOTH
TRANSACTIONS.

STEPS:
• STEP 1: T1 READS A (TS(T1) = 5).
• STEP 2: T2 ATTEMPTS TO WRITE A (TS(T2) = 8).
SINCE TS(T2) > TS(T1), THE WRITE IS ALLOWED.
• STEP 3: T1 ATTEMPTS TO WRITE A. SINCE TS(T1) <
TS(T2), T1'S WRITE IS ALLOWED, AS IT STARTED
BEFORE T2.
• STEP 4: T2 READS A. SINCE TS(T2) > TS(T1), THE
READ IS ALLOWED.

VISUAL REPRESENTATION:
• ILLUSTRATE THE TRANSACTIONS AND THEIR
TIMESTAMPS IN A TIMELINE TO SHOW THE
ORDER OF OPERATIONS.
THOMAS' WRITE RULE
• THOMAS' WRITE RULE IS A MODIFICATION TO THE TIMESTAMP
ORDERING PROTOCOL THAT ALLOWS CERTAIN OUTDATED
WRITES TO BE IGNORED.
• IT HELPS IN REDUCING UNNECESSARY OPERATIONS AND
IMPROVING EFFICIENCY.

HANDLING OUTDATED WRITES:

• IF A TRANSACTION T ATTEMPTS TO WRITE A DATA ITEM A AND THE
TIMESTAMP OF T IS LESS THAN THE TIMESTAMP OF THE MOST
RECENT WRITE TO A, THEN T'S WRITE IS IGNORED.
• THIS PREVENTS OVERWRITING WITH OUTDATED VALUES.

EXAMPLE:
• TRANSACTION T1 (TS = 3) WRITES TO A.
• TRANSACTION T2 (TS = 6) WRITES TO A.
• TRANSACTION T1 ATTEMPTS TO WRITE TO A AGAIN. SINCE TS(T1) <
TS(T2), T1'S WRITE IS IGNORED.
ADVANTAGES OF TIME STAMPING
PROTOCOL
ENSURES SERIALIZABILITY:
• GUARANTEES THAT THE SCHEDULE OF TRANSACTIONS
IS SERIALIZABLE, MEANING THE FINAL RESULT IS
EQUIVALENT TO SOME SERIAL ORDER OF THE
TRANSACTIONS.

HANDLES DEADLOCKS:
• NO NEED FOR DEADLOCK DETECTION AND
RESOLUTION, AS TRANSACTIONS ARE ORDERED BASED
ON TIMESTAMPS, PREVENTING CIRCULAR WAITS.

SIMPLE IMPLEMENTATION:
• STRAIGHTFORWARD TO IMPLEMENT COMPARED TO
SOME OTHER CONCURRENCY CONTROL METHODS, AS
IT RELIES ON TIMESTAMP ORDERING.

NO LOCKS REQUIRED:
• TRANSACTIONS ARE NOT BLOCKED, AVOIDING THE
COMPLICATIONS ASSOCIATED WITH LOCK
DISADVANTAGES OF TIME STAMPING
PROTOCOL
POTENTIAL FOR STARVATION:
• LONG-RUNNING TRANSACTIONS CAN BE REPEATEDLY
RESTARTED IF NEWER TRANSACTIONS CONTINUALLY
OVERWRITE THEIR DATA, LEADING TO STARVATION.

INCREASED OVERHEAD:
• MAINTAINING AND COMPARING TIMESTAMPS FOR
EVERY TRANSACTION CAN ADD COMPUTATIONAL
OVERHEAD..

HANDLING LONG-RUNNING TRANSACTIONS:

• LONG-RUNNING TRANSACTIONS MAY BE AT A
DISADVANTAGE, AS NEWER TRANSACTIONS WITH MORE
RECENT TIMESTAMPS MIGHT CONFLICT WITH THEM.

COMPLEXITY WITH HIGH TRANSACTION VOLUME:

• WITH A HIGH VOLUME OF TRANSACTIONS, MANAGING
AND SYNCHRONIZING TIMESTAMPS CAN BECOME
REAL-WORLD APPLICATIONS
DATABASE SYSTEMS:
• Many relational databases implement time stamping protocols tO
ENSURE CONSISTENCY IN CONCURRENT
TRANSACTIONS.

DISTRIBUTED SYSTEMS:
• TIME STAMPING IS USED TO SYNCHRONIZE
OPERATIONS ACROSS DISTRIBUTED SYSTEMS,
ENSURING CONSISTENCY ACROSS NODES.

INDUSTRIES:
• BANKING: ENSURES CONSISTENCY OF TRANSACTIONS
LIKE TRANSFERS AND WITHDRAWALS.
• E-COMMERCE: MAINTAINS CONSISTENCY OF ORDERS
AND INVENTORY UPDATES.
• TELECOMMUNICATIONS: MANAGES CALL RECORDS
AND BILLING DATA.
CONCLUSION
SUMMARY OF KEY POINTS:

• TimE STAMPING PROTOCOL ENSURES

SERIALIZABILITY AND CONSISTENCY IN
CONCURRENT TRANSACTIONS.
• IT PREVENTS DEADLOCKS AND SIMPLIFIES
CONCURRENCY CONTROL BY USING TIMESTAMPS.

IMPORTANCE OF CHOOSING THE RIGHT

CONCURRENCY CONTROL METHOD:
• DIFFERENT METHODS HAVE THEIR PROS AND CONS;
CHOOSING THE RIGHT ONE DEPENDS ON THE
SPECIFIC NEEDS AND CONSTRAINTS OF THE
APPLICATION.

FUTURE TRENDS IN CONCURRENCY CONTROL:

• INCREASING USE OF HYBRID APPROACHES
COMBINING MULTIPLE METHODS.
THANK
YOU