{
  "slug": "tango",
  "term": "Tango",
  "aliases": [
    "Tango distributed data structures"
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-16",
  "definition": "Tango is a research system that builds replicated in-memory data structures and cross-object transactions over a durable shared log.",
  "note": "An object has durable ordered history and reconstructible client-side views. A linearizable accessor first catches its view up to the observed log tail; an arbitrary cached read is not equivalent. [sosp13]\n\nUpdates within a transaction are speculative. Appending its commit record does not by itself prove success: readers check whether read-set versions changed before that log position. A conflicting transaction aborts. [sosp13]\n\nPer-object streams let clients skip unrelated updates while retaining a common order. A cross-object commit occupies one global position; consumers without the read-set views may need an additional decision record. [sosp13]\n\nThe 2013 implementation permits remote writes but not transaction reads of objects without a local view. A deployment-time limit also bounds the streams targeted by one multiappend. Partitioning therefore does not provide unrestricted cross-object access. [sosp13]\n\nStreaming CORFU requires one active sequencer per membership view. Competing sequencers can assign conflicting stream backpointers. Reconfiguration replaces the sequencer and rejects writes using the old view. The replacement scans backward to rebuild backpointer state; periodic checkpoints were future work in the 2013 paper. [sosp13]\n\nJunk-filled holes have no backpointers. If every available pointer leads to junk, the prototype scans backward for an earlier valid stream entry. Redundant pointers therefore do not eliminate the need for fallback scanning. [sosp13] With K = 4, the 12-byte stream header holds four relative backpointers but only one absolute backpointer if all relative deltas overflow. [sosp13]",
  "related": [
    "corfu",
    "linearizability",
    "optimistic-concurrency-control",
    "fuzzylog",
    "vcorfu",
    "delos"
  ],
  "citations": [
    {
      "id": "sosp13",
      "label": "Tango, SOSP 2013",
      "title": "Balakrishnan et al. Tango: Distributed Data Structures over a Shared Log. SOSP 2013, pp. 325-340; sections 3.1-3.2, 4.1 and 5 (pp. 334-335).",
      "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2013/11/Tango.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "nsdi12",
      "label": "Original CORFU sequencer role",
      "title": "Balakrishnan et al. CORFU: A Shared Log Design for Flash Clusters. NSDI 2012, section 3.3, p. 7.",
      "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2012/04/corfumain-final.pdf",
      "accessed": "2026-11-16"
    }
  ],
  "provenance": [
    "Full-paper synthesis; DOI 10.1145/2517349.2522732. Describes the 2013 implementation, not a modern API or reproduced benchmark.",
    "Failure handling follows section 5, pp. 334-335. Original CORFU section 3.3 already records sequencer identity for fast recovery; streaming changes its correctness role. [nsdi12]"
  ]
}
