{
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-16",
  "slug": "set-reconciliation",
  "term": "Set reconciliation",
  "aliases": [
    "Set difference reconciliation"
  ],
  "definition": "Set reconciliation is the task of identifying items present in one of two sets but not the other.",
  "note": "Database reconciliation can encode record identifiers together with record checksums, rather than comparing identifiers alone. [iblt2011] Hesela's example shows why equal key sets can conceal unequal values; discovering a difference does not select the authoritative version. [hesela-repair]",
  "related": [
    "anti-entropy-repair",
    "merkle-tree",
    "invertible-bloom-lookup-table",
    "rateless-iblt"
  ],
  "citations": [
    {
      "id": "iblt2011",
      "title": "Michael T. Goodrich and Michael Mitzenmacher. Invertible Bloom Lookup Tables. arXiv:1101.2245v3 (2015 revision; first submitted 2011), sections 1.3 and 2.",
      "url": "https://arxiv.org/abs/1101.2245v3",
      "accessed": "2026-10-16"
    },
    {
      "id": "hesela-repair",
      "title": "Hesela: Replica repair, set reconciliation and record identity",
      "url": "https://hesela.com/analyses/replica-repair-coverage/#set-reconciliation",
      "accessed": "2026-10-16"
    }
  ]
}