HyperLogLogLog
Published in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining • Aug 12, 2022
NobleIDNI7P62W25R96S09
Authors:,
Matti Karppa
Rasmus Pagh
Abstract
We present HyperLogLogLog, a practical compression of the HyperLogLog sketch that compresses the sketch from $O(młogłog n)$ bits down to $m łog_2łog_2łog_2 m + O(m+łogłog n)$ bits for estimating the number of distinct elements~n using m~registers. The algorithm works as a drop-in replacement that pr...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!