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:

    “Altarwise by owl-light in the half-way house
    The gentleman lay graveward with his furies;
    Abaddon in the hangnail cracked from Adam,
    And, from his fork, a dog among the fairies,
    The atlas-eater with a jaw for news,
    Bit out the mandrake with to-morrow’s scream.”
    —Dylan Thomas (1914–1953)

    “Always speak the truth—think before you speak—and write it down afterwards.”
    —Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)

    “All you people don’t know about lost causes. Mr. Paine does. He said once they were the only causes worth fighting for, and he fought for them once, for the only reason that any man ever fights for them. Because of just one plain, simple rule—Love Thy Neighbor. And in this world today, full of hatred, a man who knows that one rule has a great trust.”
    —Sidney Buchman (1902–1975)