Comment on page
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.
hash type: HASH64
registry width: 3
The distinct count computation occurs for every see with the result being added to the output event as a named map of field and associated counts using the provided name.