arunodhaya

4 ms·

1. 1.▲
   by arunodhaya 1y ago

   Thanks a lot, Erik. I learnt so much from digging into your code and attempting to implement parts of it by referring to your code, especially around Raft. Looking forward to doing it again. Absolutely fantastic work.
2. 2.▲
   by arunodhaya 3y ago

   HyperLogLog is a probabilistic algorithm that allows for a highly accurate "estimation" of the number of distinct elements in a dataset. In this post, we'll see how HLL works and implement it in Rust.
3. 3.▲
   What is HyperLogLog and how to build yours in Rust(arunma.com)

   2 points by arunodhaya 3y ago|1 comments
4. 4.▲
   Build your own CountMinSketch in Rust(arunma.com)

   2 points by arunodhaya 4y ago|1 comments
5. 5.▲
   by arunodhaya 4y ago

   CountMinSketch is a probabilistic data structure to quickly estimate frequencies of elements in a stream or large datasets. At the end of the post, you'll be able to build your own CountMinSketch in Rust.