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 thomas, write and/or rule:

    “There was a weasel lived in the sun
    With all his family,
    Till a keeper shot him with his gun”
    —Edward Thomas (1878–1917)

    “Alone with our madness and favorite flower
    We see that there really is nothing left to write about.
    Or rather, it is necessary to write about the same old things
    In the same way, repeating the same things over and over
    For love to continue and be gradually different.”
    —John Ashbery (b. 1927)

    “Here’s the rule for bargains: “Do other men, for they would do you.” That’s the true business precept.”
    —Charles Dickens (1812–1870)