Show HN: Mojo Implementation of HyperLogLog for Efficient Cardinality Estimation
1–5 of 5 posts
Re: Show HN: Mojo Implementation of HyperLogLog for Efficient Cardinality Estimation
#2This would be faster using Estrin’s scheme [0]. This is just the kind of optimization that Mojo should be able to do.
Re: Show HN: Mojo Implementation of HyperLogLog for Efficient Cardinality Estimation
#3[deleted]
Re: Show HN: Mojo Implementation of HyperLogLog for Efficient Cardinality Estimation
#4This would be faster using Estrin’s scheme [0]. This is just the kind of optimization that Mojo should be able to do. [0] https://en.m.wikipedia.org/wiki/Estrin%27s_scheme
I fail to see how this works with hyperloglog. But will read more
Re: Show HN: Mojo Implementation of HyperLogLog for Efficient Cardinality Estimation
#5This would be faster using Estrin’s scheme [0]. This is just the kind of optimization that Mojo should be able to do. [0] https://en.m.wikipedia.org/wiki/Estrin%27s_scheme
I fail to see how this works with hyperloglog. But will read more
I meant for the `get_beta` function which does polynomial evaluation.