Timestamp-based concurrency control

In computer science, a timestamp-based concurrency control algorithm is a optimistic concurrency control method. It is used in some databases to safely handle transactions using timestamps.

• Every timestamp value is unique and accurately represents an instant in time.
• A higher-valued timestamp occurs later in time than a lower-valued timestamp.

A number of different approaches can generate timestamps

• Using the value of the system's clock at the start of a transaction as the timestamp.
• Using a thread-safe shared counter that is incremented at the start of a transaction as the timestamp.
• A combination of the above two methods.

Each transaction (${\displaystyle T_{i}}$) is an ordered list of actions (${\displaystyle A_{ix}}$). Before the transaction performs its first action (${\displaystyle A_{i1}}$), it is marked with the current timestamp, or any other strictly totally ordered sequence: ${\displaystyle TS(T_{i})=NOW()}$. Every transaction is also given an initially empty set of transactions upon which it depends, ${\displaystyle DEP(T_{i})=[]}$, and an initially empty set of old objects which it updated, ${\displaystyle OLD(T_{i})=[]}$.

Each object ${\displaystyle (O_{j})}$ in the database is given two timestamp fields which are not used other than for concurrency control:

• ${\displaystyle RT(O_{j})}$ is the timestamp of the last transaction that read the value of the object ( ${\displaystyle TS(T_{r})}$, where ${\displaystyle T_{r}}$ is the last transaction that read the value of the object).
• ${\displaystyle WT(O_{j})}$ is the timestamp of the last transaction that updated the value of the object ( ${\displaystyle TS(T_{w})}$, where ${\displaystyle T_{w}}$ is the last transaction that updated the value of the object).

For all ${\displaystyle T_{i}}$:

For each action ${\displaystyle A_{ix}}$:

If ${\displaystyle A_{ix}}$ wishes to read the value of ${\displaystyle O_{j}}$:

If ${\displaystyle WT(O_{j})>TS(T_{i})}$ then abort (a more recent thread has overwritten the value),

Otherwise update the set of dependencies ${\displaystyle DEP(T_{i}).\mathrm {add} (WT(O_{j}))}$ and set ${\displaystyle RT(O_{j})=\max(RT(O_{j}),TS(T_{i}))}$;

If ${\displaystyle A_{ix}}$ wishes to update the value of ${\displaystyle O_{j}}$:

If ${\displaystyle RT(O_{j})>TS(T_{i})}$ then abort (a more recent thread is already relying on the old value),

If ${\displaystyle WT(O_{j})>TS(T_{i})}$ then skip (the Thomas Write Rule),

Otherwise store the previous values, ${\displaystyle OLD(T_{i}).\mathrm {add} (O_{j},WT(O_{j}))}$, set ${\displaystyle WT(O_{j})=TS(T_{i})}$, and update the value of ${\displaystyle O_{j}}$.

While there is a transaction in ${\displaystyle DEP(T_{i})}$ that has not ended: wait

If there is a transaction in ${\displaystyle DEP(T_{i})}$ that aborted then abort

Otherwise: commit.

To abort:

For each ${\displaystyle (\mathrm {old} O_{j},\mathrm {old} WT(O_{j}))}$ in ${\displaystyle OLD(T_{i})}$

If ${\displaystyle WT(O_{j})}$ equals ${\displaystyle TS(T_{i})}$ then restore ${\displaystyle O_{j}=\mathrm {old} O_{j}}$ and ${\displaystyle WT(O_{j})=\mathrm {old} WT(O_{j})}$

Whenever a transaction initiated, it receives a timestamp. The transaction's timestamp indicates when the transaction was initiated. These timestamps ensure that transactions affect each object in the same sequence of their respective timestamps. Thus, given two operations that affect the same object from different transactions, the operation of the transaction with the earlier timestamp must execute before the operation of the transaction with the later timestamp. However, if the operation of the wrong transaction is actually presented first, then it is aborted and the transaction must be restarted.

Every object in the database has a read timestamp, which is updated whenever the object's data is read, and a write timestamp, which is updated whenever the object's data is changed.

If a transaction wants to read an object,

• but the transaction started before the object's write timestamp it means that something changed the object's data after the transaction started. In this case, the transaction is canceled and must be restarted.
• and the transaction started after the object's write timestamp, it means that it is safe to read the object. In this case, if the transaction's timestamp is after the object's read timestamp, the read timestamp is set to the transaction's timestamp.

If a transaction wants to write to an object,

• but the transaction started before the object's read timestamp it means that something has had a look at the object, and we assume it took a copy of the object's data. So we can't write to the object as that would make any copied data invalid, so the transaction is aborted and must be restarted.
• and the transaction started before the object's write timestamp it means that something has changed the object since we started our transaction. In this case we use the Thomas write rule and simply skip our write operation and continue as normal; the transaction does not have to be aborted or restarted
• otherwise, the transaction writes to the object, and the object's write timestamp is set to the transaction's timestamp.

The behavior is physically unrealizable if the results of transactions could not have occurred if transactions were instantaneous. The following are the only two situations that result in physically unrealizable behavior:

1. Transaction T tries to read X but TS(T) < WT(X). Reason: It means that X has been written to by another transaction after T began.
2. Transaction T tries to write X but TS(T) < RT(X). Reason: It means that a later transaction read X before it was written by T.

Note that timestamp ordering in its basic form does not produce recoverable histories. Consider for example the following history with transactions ${\displaystyle T_{1}}$ and ${\displaystyle T_{2}}$:

${\displaystyle W_{1}(x)\;R_{2}(x)\;W_{2}(y)\;C_{2}\;R_{1}(z)\;C_{1}}$

This could be produced by a TO scheduler, but is not recoverable, as ${\displaystyle T_{2}}$ commits even though having read from an uncommitted transaction. To make sure that it produces recoverable histories, a scheduler can keep a list of other transactions each transaction has read from, and not let a transaction commit before this list consisted of only committed transactions. To avoid cascading aborts, the scheduler could tag data written by uncommitted transactions as dirty, and never let a read operation commence on such a data item before it was untagged. To get a strict history, the scheduler should not allow any operations on dirty items.

This is the minimum time elapsed between two adjacent timestamps. If the resolution of the timestamp is too large (coarse), the possibility of two or more timestamps being equal is increased and thus enabling some transactions to commit out of correct order. For example, for a system that creates one hundred unique timestamps per second, two events that occur 2 milliseconds apart may be given the same timestamp even though they occurred at different times.

Even though this technique is a non-locking one, in as much as the object is not locked from concurrent access for the duration of a transaction, the act of recording each timestamp against the Object requires an extremely short duration lock on the Object or its proxy.

• Multiversion concurrency control
• Timestamping (computing)