T3C: a temporally correct concurrency control algorithm for distributed databases

In some scenarios involving online transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by original transaction start times while providing each transaction with an anomaly-serializable isolation. Few theoretical concurrency control algorithms guarantee such a conflict equivalence, and we are unaware of any protocol that accomplishes this while supporting real-world issues such as out-of-order transaction messages, out-of-order operation executions and out-of-order transaction committals without the burden of explicit read-set and write-set declarations. We describe an algorithm called T3C (Temporally Correct Concurrency Control) that provides this guarantee and supports these issues while requiring only table-level write-set declarations.