{
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "slug": "heavy-hitter",
  "term": "Heavy hitter",
  "aliases": [
    "Frequent item",
    "Frequency-threshold heavy hitter"
  ],
  "definition": "A frequency-threshold heavy hitter is a key whose count or nonnegative weight exceeds a specified share of the total over a defined observation window.",
  "note": "This record uses the strict convention f(x) > phi*N, where N is total observed mass and 0 < phi < 1. Other contracts use an inclusive threshold; record the convention. A top-k query instead selects the highest-frequency keys for a requested k, subject to available identities and a stated tie policy; it need not impose any minimum traffic share. [misra] [space]\n\nCandidate discovery, frequency estimation and exact verification are separate steps. Misra-Gries and Space-Saving retain key identities with bounds; bare Count-Min counters answer queries about supplied identities. Count-Min heavy-hitter constructions add candidate-tracking or hierarchical structures. An estimate is not an exact recount. [cm] [space]\n\nFor a constructed three-request stream A B C, no key exceeds one third of the requests, although all tie for the highest count. Two-counter Misra-Gries returns no candidate at this strict boundary. The existing executable example records the complete input and result. [worked]",
  "related": [
    "misra-gries",
    "space-saving",
    "count-min-sketch",
    "cache-admission"
  ],
  "citations": [
    {
      "id": "misra",
      "title": "Jayadev Misra. A Proof of a Heavy Hitters Algorithm (2018), introduction and section 3.",
      "url": "https://www.cs.utexas.edu/~misra/Notes.dir/HeavyHitters.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "space",
      "title": "Metwally, Agrawal and El Abbadi. Efficient Computation of Frequent and Top-k Elements in Data Streams, sections 1 and 3-4.",
      "url": "https://www.cs.emory.edu/~cheung/Courses/584/Syllabus/papers/Frequency-count/2005-Metwally-Top-k-elements.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "cm",
      "title": "Cormode and Muthukrishnan. An Improved Data Stream Summary: The Count-Min Sketch and its Applications, sections 4.1 and 5.2.",
      "url": "https://www.cs.ox.ac.uk/people/graham.cormode/pubs/papers/cm-full.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "worked",
      "title": "Hesela. Frequent-item certificates: strict-boundary example and executable checks.",
      "url": "https://hesela.dev/research/heavy-hitter-certificates/README.md",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "Scope is frequency or nonnegative-weight share (L1), not the separate L2 heavy-hitter definition based on squared frequencies.",
    "Request counts, byte weights and service-time weights answer different questions. Define key identity, counted unit, stream completeness and the window before interpreting a result.",
    "The weighted definition does not extend unit-insertion algorithm proofs to weighted updates, expiration, deletion or merging. Those need an explicit algorithm-specific contract.",
    "The worked example is constructed, not measured device traffic or a cache-performance benchmark."
  ]
}
