Show HN: Mojo Implementation of HyperLogLog for Efficient Cardinality Estimation (opens in new tab)

(github.com)

1 pointsseiflotfy1y ago3 comments

3 comments

3 comments · 1 top-level

onedognight1y ago· 2 in thread

This would be faster using Estrin’s scheme [0]. This is just the kind of optimization that Mojo should be able to do.

I fail to see how this works with hyperloglog. But will read more

I meant for the `get_beta` function which does polynomial evaluation.

j / k navigate · click thread line to collapse