Matti Karppa

HyperLogLogLog: Cardinality Estimation With One Log More

2022 · arXiv (Cornell University)

We present HyperLogLogLog, a practical compression of the HyperLogLog sketch that compresses the sketch from $O(m\log\log n)$ bits down to $m \log_2\log_2\log_2 m + O(m+\log\log n)$ bits for estimating the number of distinct elements~$n$ using …