HyperLogLog
Probabilistic counter for large or high cardinality datasets
Overview
HyperLogLog processor provides an implementation 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.
Example & DSL attributes
Response
The processor adds a distinctIMSICounter
attribute with the following result
Attributes schema
Additional Information
Article about HyperLogLog for more information
Last updated