Construct · 1 fields · 1 citations

heavy hitters problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Streaming algorithms

the task of finding the items that appear more than a set fraction of the time in a data stream using memory far smaller than the stream.

In streaming algorithms, heavy hitters problem refers to the task of finding the items that appear more than a set fraction of the time in a data stream using memory far smaller than the stream. This meaning comes from Misra (1982) in Science of Computer Programming.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how heavy hitters problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

memory6 fields · 18 citationsjingle · one name, six constructs stream2 fields · 2 citationsjingle · one word, two constructs

References

Misra, J., & Gries, D. (1982). Finding repeated elements. Science of Computer Programming, 2(2), 143-152. https://doi.org/10.1016/0167-6423(82)90012-0

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct