Construct · 1 fields · 1 citations

probabilistic counting: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
probabilisticcounting1 CONSTRUCTProbabilistic countingFLAJOLET · ALGORITHMS AND DATA

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

Algorithms and data structures

a method that estimates the number of distinct items in a large collection from bit patterns of hashed values in a single pass with small memory.

In algorithms and data structures, probabilistic counting refers to a method that estimates the number of distinct items in a large collection from bit patterns of hashed values in a single pass with small memory. This meaning comes from Flajolet (1985) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Next

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

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

Open in ColliderExport BibTeXReport this entry

Nearby constructs

memory6 fields · 18 citationsjingle · one name, six constructsnumber3 fields · 6 citationsjingle · one word, three constructs

References

  1. Flajolet, P., & Nigel Martin, G. (1985). Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2), 182-209. https://doi.org/10.1016/0022-0000(85)90041-8

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