{
  "slug": "minhash",
  "term": "MinHash",
  "aliases": [
    "min-wise hashing",
    "minwise hashing"
  ],
  "definition": "MinHash summarizes sets using minimum hash values to estimate their Jaccard similarity.",
  "note": "In the classic independent-coordinate construction, each coordinate keeps the minimum under one shared random permutation. For nonempty sets, the probability of equal minima is their intersection size divided by their union size; the fraction of matching coordinates estimates this ratio. Ordinary pairwise independence alone does not establish this collision identity. [minwise]\n\nUnion takes coordinatewise minima of compatible signatures. Preserve the item representation, hash function and width, permutation family, seed and coordinate order; equal lengths alone do not establish compatibility. Practical hash families need their own error analysis. [implementation]\n\nRepeated occurrences of an unchanged identity do not change the signature. A signature match is not proof that the input byte streams are equal. In a constructed chunk example, set similarity stays 1/3 while the share of incoming bytes already present changes from 1/2 to 9/10 as chunk sizes change. [examples]\n\nThis coordinate-matching construction differs from retaining several low-ranked hashes under one ordering. Theta sketches instead retain distinct hashes below a threshold and support set expressions. [theta]",
  "status": "shipping",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "related": [
    "jaccard-similarity",
    "theta-sketch",
    "deduplication",
    "cryptographic-hash",
    "content-defined-chunking"
  ],
  "citations": [
    {
      "id": "minwise",
      "title": "Broder, Charikar, Frieze and Mitzenmacher. Min-Wise Independent Permutations. JCSS 60(3), 2000, pp. 632-633.",
      "url": "https://www.eecs.harvard.edu/~michaelm/postscripts/jcss2000.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "implementation",
      "title": "datasketch MinHash implementation: signature comparison, union and permutation-scheme assumptions.",
      "url": "https://ekzhu.com/datasketch/_modules/datasketch/minhash.html",
      "accessed": "2026-11-20"
    },
    {
      "id": "examples",
      "title": "Hesela. MinHash and deduplication denominators: exact finite-set illustration and tests.",
      "url": "https://hesela.dev/research/minhash/README.md",
      "accessed": "2026-11-20"
    },
    {
      "id": "theta",
      "title": "Apache DataSketches. Theta Sketch Framework: thresholded state and set operations.",
      "url": "https://datasketches.apache.org/docs/Theta/ThetaSketches.html",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "The worked examples enumerate ideal finite permutations and exact chunk identities, not a deployed MinHash library or storage workload. [examples]"
  ]
}
