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:

    “Deep with the first dead lies London’s daughter,
    Robed in the long friends,
    The grains beyond age, the dark veins of her mother,
    Secret by the unmourning water
    Of the riding Thames.
    After the first death, there is no other.”
    —Dylan Thomas (1914–1953)

    “Men must speak English who can write Sanskrit; they must speak a modern language who write, perchance, an ancient and universal one.”
    —Henry David Thoreau (1817–1862)

    “We’ve only just begun to learn about the water and its secrets, just as we’ve only touched on outer space. We don’t entirely rule out the possibility that there might be some form of life on another planet. Then why not some entirely different form of life in a world we already know is inhabited by millions of living creatures?”
    —Harry Essex (b. 1910)