1 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Matti Karppa, Rasmus Pagh
We present HyperLogLogLog, a practical compression of the HyperLogLog sketch that compresses the sketch from O(mloglogn) bits down to $m \log_2\log_2\log_2 m + O(m+\log\log n)…