Breaking Taps on MSNOpinion

A problem so hard even Google relies on random chance

Today we're looking at HyperLogLog, an algorithm that leverages random chance to count the number of distinct items are in a ...
IEEE

Sliding HyperLogLog: Estimating Cardinality in a Data Stream over a Sliding Window

Abstract: In this paper, a new algorithm estimating the number of active flows in a data stream is proposed. This algorithm adapts the HyperLogLog algorithm of Flajolet et al. to data stream ...
搜狐

Redis HyperLogLog数据结构详解及示例

Redis中的HyperLogLog是一种高级数据结构，它主要用于基数估算。在数据量非常大的情况下，HyperLogLog能够以极小的空间消耗来估算数据集的基数（即不重复元素的数量）。其标准误差率仅为0.81%，因此在很多需要快速且大致估算基数的场景中，HyperLogLog都是一个非常 ...
GitHub

hyperloglog-foxx adds HyperLogLog algorithm implementation as arangodb foxx app.

the state of each instance is stored as serialized JSON (string) under _hll key. each instance weight is ~8kb at 12 registers with a mathematical error of ~1.6%. The ...
GitHub

Count distinct values/cardinalities using HyperLogLog algorithm.

For a quick read of the HyperLogLog algorithm please refer to https://research.neustar.biz/2012/10/25/sketch-of-the-day-hyperloglog-cornerstone-of-a-big-data ...