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 is not any book
    Or face of dearest look
    That I would not turn from now
    To go into the unknown
    I must enter, and leave, alone,
    I know not how.”
    —Edward Thomas (1878–1917)

    “If writers were too wise, perhaps no books would get written at all. It might be better to ask yourself “Why?” afterwards than before. Anyway, the force from somewhere in Space which commands you to write in the first place, gives you no choice. You take up the pen when you are told, and write what is commanded. There is no agony like bearing an untold story inside you.”
    —Zora Neale Hurston (1891–1960)

    “The earliest instinct of the child, and the ripest experience of age, unite in affirming simplicity to be the truest and profoundest part for man. Likewise this simplicity is so universal and all-containing as a rule for human life, that the subtlest bad man, and the purest good man, as well as the profoundest wise man, do all alike present it on that side which they socially turn to the inquisitive and unscrupulous world.”
    —Herman Melville (1819–1891)