Construct · 1 fields · 1 citations

count-min sketch: 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.

Algorithms

a small randomized summary of a data stream using several hash-indexed counter rows that gives frequency estimates with bounded overcount.

In algorithms, count-min sketch refers to a small randomized summary of a data stream using several hash-indexed counter rows that gives frequency estimates with bounded overcount. This meaning comes from Cormode (2005) in Journal of Algorithms.[1]

Unit
Recovery means
Measured by

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

See how count-min sketch 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

counter1 fields · 1 citationsanchor · a standalone construct frequency4 fields · 7 citationsjingle · one word, four constructs stream2 fields · 2 citationsjingle · one word, two constructs

References

Cormode, G., & Muthukrishnan, S. (2005). An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 55(1), 58-75. https://doi.org/10.1016/j.jalgor.2003.12.001

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