Thomas Write Rule

In computer science, particularly the field of databases, the Thomas Write rule is a rule in timestamp-based concurrency control.

It states that, if a more recent transaction has already written the value of an object, then a less recent transaction does not need perform its own write since it will eventually be overwritten by the more recent one.

For example:

$\begin{bmatrix} T_1 & T_2 \\ & Read(A) \\ Read(B) & \\ &Write(C) \\ Write(C) & \\ Commit & \\ & Commit \end{bmatrix} \Longleftrightarrow \begin{bmatrix} T_1 & T_2 \\ & Read(A) \\ Read(B) & \\ & Write(C) \\ & \\ Commit & \\ & Commit\\ \end{bmatrix}$

Assuming that the timestamp of T1 is less than that of T2, T1's write is discarded.

If TS(T)Thomas Write Rule

Famous quotes containing the words write and/or rule:

“In a time of confusion and rapid change like the present, when terms are continually turning inside out and the names of things hardly keep their meaning from day to day, it’s not possible to write two honest paragraphs without stopping to take crossbearings on every one of the abstractions that were so well ranged in ornate marble niches in the minds of our fathers.”
—John Dos Passos (1896–1970)

“For all of us Frenchmen, the guiding rule of our epoch is to be faithful to France.”
—Charles De Gaulle (1890–1970)