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.

Operation

Assumptions

• 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.

Generating a timestamp

A number of different ways have been used to generate timestamp

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

Formal

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

Each object [math]\displaystyle{ (O_j) }[/math] in the database is given two timestamp fields which are not used other than for concurrency control: [math]\displaystyle{ RT(O_j) }[/math] is the time at which the value of object was last read by a transaction, [math]\displaystyle{ WT(O_j) }[/math] is the time at which the value of the object was last updated by a transaction.

For all [math]\displaystyle{ T_i }[/math]:

For each action [math]\displaystyle{ A_{ix} }[/math]:

If [math]\displaystyle{ A_{ix} }[/math] wishes to read the value of [math]\displaystyle{ O_j }[/math]:

If [math]\displaystyle{ WT(O_j) \gt TS(T_i) }[/math] then abort (a more recent thread has overwritten the value),

Otherwise update the set of dependencies [math]\displaystyle{ DEP(T_i).\mathrm{add}(WT(O_j)) }[/math] and set [math]\displaystyle{ RT(O_j) = \max(RT(O_j), TS(T_i)) }[/math];

If [math]\displaystyle{ A_{ix} }[/math] wishes to update the value of [math]\displaystyle{ O_j }[/math]:

If [math]\displaystyle{ RT(O_j) \gt TS(T_i) }[/math] then abort (a more recent thread is already relying on the old value),

If [math]\displaystyle{ WT(O_j) \gt TS(T_i) }[/math] then skip (the Thomas Write Rule),

Otherwise store the previous values, [math]\displaystyle{ OLD(T_i).\mathrm{add}(O_j, WT(O_j)) }[/math], set [math]\displaystyle{ WT(O_j) = TS(T_i) }[/math], and update the value of [math]\displaystyle{ O_j }[/math].

While there is a transaction in [math]\displaystyle{ DEP(T_i) }[/math] that has not ended: wait

If there is a transaction in [math]\displaystyle{ DEP(T_i) }[/math] that aborted then abort

Otherwise: commit.

To abort:

For each [math]\displaystyle{ (\mathrm{old}O_j, \mathrm{old}WT(O_j)) }[/math] in [math]\displaystyle{ OLD(T_i) }[/math]

If [math]\displaystyle{ WT(O_j) }[/math] equals [math]\displaystyle{ TS(T_i) }[/math] then restore [math]\displaystyle{ O_j = \mathrm{old}O_j }[/math] and [math]\displaystyle{ WT(O_j) = \mathrm{old}WT(O_j) }[/math]

Informal

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.

Physically unrealizable

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.

Recoverability

Note that timestamp ordering in its basic form does not produce recoverable histories. Consider for example the following history with transactions [math]\displaystyle{ T_1 }[/math] and [math]\displaystyle{ T_2 }[/math]:

[math]\displaystyle{ W_1(x)\;R_2(x)\;W_2(y)\;C_2\;R_1(z)\;C_1 }[/math]

This could be produced by a TO scheduler, but is not recoverable, as [math]\displaystyle{ T_2 }[/math] 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.

Implementation issues

Timestamp resolution

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, assuming that we have a system that can create one hundred unique timestamps per second, and given two events that occur 2 milliseconds apart, they will probably be given the same timestamp even though they actually occurred at different times.

Timestamp locking

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.

See also

• Multiversion concurrency control
• Timestamping (computing)