The Flajolet–Martin algorithm is an algorithm for approximating the number of distinct elements in a stream with a single pass and space-consumption logarithmic in the maximal number of possible distinct elements in the stream (the count-distinct problem). The algorithm was introduced by Philippe Flajolet and G. Nigel Martin in their 1984 article "Probabilistic Counting Algorithms for Data Base Applications".^[1] Later it has been refined in "LogLog counting of large cardinalities" by Marianne Durand and Philippe Flajolet,^[2] and "HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm" by Philippe Flajolet et al.^[3]

In their 2010 article "An optimal algorithm for the distinct elements problem",^[4] Daniel M. Kane, Jelani Nelson and David P. Woodruff give an improved algorithm, which uses nearly optimal space and has optimal O(1) update and reporting times.

The algorithm

Assume that we are given a hash function ${\displaystyle \mathrm {hash} (x)}$ that maps input ${\displaystyle x}$ to integers in the range ${\displaystyle [0;2^{L}-1]}$, and where the outputs are sufficiently uniformly distributed. Note that the set of integers from 0 to ${\displaystyle 2^{L}-1}$ corresponds to the set of binary strings of length ${\displaystyle L}$. For any non-negative integer ${\displaystyle y}$, define ${\displaystyle \mathrm {bit} (y,k)}$ to be the ${\displaystyle k}$-th bit in the binary representation of ${\displaystyle y}$, such that:

${\displaystyle y=\sum _{k\geq 0}\mathrm {bit} (y,k)2^{k}.}$

We then define a function ${\displaystyle \rho (y)}$ that outputs the position of the least-significant set bit in the binary representation of ${\displaystyle y}$, and ${\displaystyle L}$ if no such set bit can be found as all bits are zero:

${\displaystyle \rho (y)={\begin{cases}\min\{k\geq 0\mid \mathrm {bit} (y,k)\neq 0\}&y>0\\L&y=0\end{cases}}}$

Note that with the above definition we are using 0-indexing for the positions, starting from the least significant bit. For example, ${\displaystyle \rho (13)=\rho (1101_{2})=0}$, since the least significant bit is a 1 (0th position), and ${\displaystyle \rho (8)=\rho (1000_{2})=3}$, since the least significant set bit is at the 3rd position. At this point, note that under the assumption that the output of our hash function is uniformly distributed, then the probability of observing a hash output ending with ${\displaystyle 2^{k}}$ (a one, followed by ${\displaystyle k}$ zeroes) is ${\displaystyle 2^{-(k+1)}}$, since this corresponds to flipping ${\displaystyle k}$ heads and then a tail with a fair coin.

Now the Flajolet–Martin algorithm for estimating the cardinality of a multiset ${\displaystyle M}$ is as follows:

1. Initialize a bit-vector BITMAP to be of length ${\displaystyle L}$ and contain all 0s.
2. For each element ${\displaystyle x}$ in ${\displaystyle M}$:
   1. Calculate the index ${\displaystyle i=\rho (\mathrm {hash} (x))}$.
   2. Set ${\displaystyle \mathrm {BITMAP} [i]=1}$.
3. Let ${\displaystyle R}$ denote the smallest index ${\displaystyle i}$ such that ${\displaystyle \mathrm {BITMAP} [i]=0}$.
4. Estimate the cardinality of ${\displaystyle M}$ as ${\displaystyle 2^{R}/\phi }$, where ${\displaystyle \phi \approx 0.77351}$.

The idea is that if ${\displaystyle n}$ is the number of distinct elements in the multiset ${\displaystyle M}$, then ${\displaystyle \mathrm {BITMAP} [0]}$ is accessed approximately ${\displaystyle n/2}$ times, ${\displaystyle \mathrm {BITMAP} [1]}$ is accessed approximately ${\displaystyle n/4}$ times and so on. Consequently, if ${\displaystyle i\gg \log _{2}n}$, then ${\displaystyle \mathrm {BITMAP} [i]}$ is almost certainly 0, and if ${\displaystyle i\ll \log _{2}n}$, then ${\displaystyle \mathrm {BITMAP} [i]}$ is almost certainly 1. If ${\displaystyle i\approx \log _{2}n}$, then ${\displaystyle \mathrm {BITMAP} [i]}$ can be expected to be either 1 or 0.

The correction factor ${\displaystyle \phi \approx 0.77351}$ is found by calculations, which can be found in the original article.

Improving accuracy

A problem with the Flajolet–Martin algorithm in the above form is that the results vary significantly. A common solution has been to run the algorithm multiple times with ${\displaystyle k}$ different hash functions and combine the results from the different runs. One idea is to take the mean of the ${\displaystyle k}$ results together from each hash function, obtaining a single estimate of the cardinality. The problem with this is that averaging is very susceptible to outliers (which are likely here). A different idea is to use the median, which is less prone to be influences by outliers. The problem with this is that the results can only take form ${\displaystyle 2^{R}/\phi }$, where ${\displaystyle R}$ is integer. A common solution is to combine both the mean and the median: Create ${\displaystyle k\cdot l}$ hash functions and split them into ${\displaystyle k}$ distinct groups (each of size ${\displaystyle l}$). Within each group use the mean for aggregating together the ${\displaystyle l}$ results, and finally take the median of the ${\displaystyle k}$ group estimates as the final estimate.^[5]

The 2007 HyperLogLog algorithm splits the multiset into subsets and estimates their cardinalities, then it uses the harmonic mean to combine them into an estimate for the original cardinality.^[3]

See also

• Streaming algorithm
• HyperLogLog

References

Additional sources

• Rajaraman, Anand; Ullman, Jeffrey David (2011-10-27). Mining of Massive Datasets. Cambridge University Press. p. 119. ISBN 9781139505345. Retrieved 2014-11-09.