{
  "slug": "calvin",
  "term": "Calvin",
  "aliases": [],
  "definition": "Calvin is a research transaction scheduling and replication architecture that orders transaction inputs before executing them with deterministic concurrency control.",
  "note": "The sequencer logs and replicates inputs; schedulers enforce an equivalent serial order while allowing concurrent execution. Agreement precedes lock acquisition, removing a separate distributed commit phase from the lock-holding interval. This does not remove replication, communication or recovery. Deterministic business-rule aborts remain possible. Recovery uses replicas or replay from checkpoints and retained input history. [calvin-2012]\n\nThe scheduler needs read/write sets in advance. Optimistic Lock Location Prediction uses a preliminary reconnaissance read to discover dependent accesses, then rechecks the prediction during ordered execution. A changed dependency triggers a restart; the preliminary read is not the transaction's authoritative read. [calvin-2014]\n\nThe 2014 evaluation compares deterministic and nondeterministic locking within one prototype. Its no-commit-protocol baseline is deliberately unsafe, used to isolate overhead, not a deployable alternative. Delayed dependent reads add reconnaissance work; slow partitions can propagate stalls because a replica cannot independently shed agreed work by aborting it. [determinism-evaluation]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "The TODS dependent-transaction experiment uses artificial replication delays and single-partition transactions; it is not a measured WAN deployment of that workload.",
      "citationIds": [
        "calvin-2014"
      ]
    },
    {
      "text": "Lower contention or fewer commit messages does not guarantee lower end-to-end latency; preprocessing and dependency prediction have costs.",
      "citationIds": [
        "determinism-evaluation"
      ]
    }
  ],
  "related": [
    "two-phase-commit",
    "two-phase-locking",
    "hyder"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-16",
  "citations": [
    {
      "id": "calvin-2012",
      "title": "Thomson et al. Calvin: Fast Distributed Transactions for Partitioned Database Systems. SIGMOD 2012, sections 1.3-3.2 and 5.",
      "url": "https://www.cs.umd.edu/~abadi/papers/calvin-sigmod12.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "calvin-2014",
      "title": "Thomson et al. Fast Distributed Transactions and Strongly Consistent Replication for OLTP Database Systems. TODS 39(2), 2014, sections 3.2.1 and 7.4.",
      "url": "https://www.cs.umd.edu/~abadi/papers/calvin-tods14.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "determinism-evaluation",
      "title": "Ren et al. An Evaluation of the Advantages and Disadvantages of Deterministic Database Systems. PVLDB 7(10), 2014, sections 3.1 and 3.5-3.7.",
      "url": "https://www.cs.umd.edu/~abadi/papers/determinism-eval.pdf",
      "accessed": "2026-11-16"
    }
  ],
  "provenance": [
    "Primary-source synthesis of the 2012 design and two distinct 2014 studies. No Calvin execution, benchmark reproduction or failure injection was performed."
  ]
}
