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:

    “Up through the lubber crust of Wales
    I rocketed to astonish
    The flashing needle rock of squatters,
    The criers of Shabby and Shorten,
    The famous stitch droppers.”
    —Dylan Thomas (1914–1953)

    “I would love to be able to write a tragedy in my imagination—it would turn into a masterpiece.”
    —Franz Grillparzer (1791–1872)

    “The rule for hospitality and Irish “help,” is, to have the same dinner every day throughout the year. At last, Mrs. O’Shaughnessy learns to cook it to a nicety, the host learns to carve it, and the guests are well served.”
    —Ralph Waldo Emerson (1803–1882)