Lazy consistency is similar to ``degree-2 isolation''; using the terminology of Gray and Reuter , our system provides degree-3 isolation for all committed transactions and degree-2 isolation for running transactions.
Earlier research has investigated ways of providing consistency for read-only transactions  using serializability or weaker notions of consistency that are different from lazy consistency. For example, some schemes ensure that a read-only transaction is serializable with all read-write transactions but the whole system may not be serializable when all read-only transactions are taken into account.
Chan and Gray  propose lazy consistency as a correctness criterion but their work is concerned with committing read-only transactions more cheaply as opposed to providing consistency for transactions that abort. They also propose an implementation technique for a distributed client/server system using a kind of multistamp scheme but ignore all details that would make it a practical scheme.
Our work is related to orphan detection schemes . Such schemes abort transactions before they can observe an inconsistency; they guarantee a stronger property than lazy consistency since they detect anti-dependencies also (discussed in Section 3).