HyperLogLog
Approximate distinct counting algorithm
HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality of the distinct elements of a multiset requires an amount of memory proportional to the cardinality, which is impractical for very large data sets.
Nº Q17092118 ★★
Uncommon · Knowledge
HyperLogLog
Approximate distinct counting algorithm
HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality of the distinct elements of a multiset requires an amount of memory proportional to the cardinality, which is impractical for very large data sets.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality of the distinct elements of a multiset requires an amount of memory proportional to the cardinality, which is impractical for very large data sets. Probabilistic cardinality estimators, such as the HyperLogLog algorithm, use significantly less memory than this, but can only approximate the cardinality. The HyperLogLog algorithm is able to estimate cardinalities of > 109 with a typical accuracy (standard error) of 2%, using 1.5 kB of memory. HyperLogLog is an extension of the earlier LogLog algorithm, itself deriving from the 1984 Flajolet–Martin algorithm.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Cantor's theorem
In set theory, the theorem that a set has a strictly smaller cardinality than its powerset
Nº Q474881 ★★
Latin hypercube sampling
Statistical method for generating a near-random sample of parameter values from a multidimensional distribution
Nº Q6496514 ★★
Limited-memory BFGS
Optimization algorithm
Nº Q6549489 ★★
Kolmogorov complexity
Measure of algorithmic complexity
Nº Q1456811 ★★★
Grover's algorithm
Quantum unstructured search algorithm that finds with high probability the unique input to a black box function that produces a particular output value using 𝑂(𝑁) evaluations
Nº Q1028292 ★★
Bloom filter
Hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives
Nº Q885373 ★★★