Jan 21 · 9 min read · Ok, before we go into the depths of these concepts, I want to tell you that we will take it easy. I don’t want you to get overwhelmed about the topics and the depth of the discussion. Bloom Filters A Bloom filter is a space-efficient probabilistic d...
Join discussion
Jun 25, 2025 · 3 min read · Introduction Count min sketch is a probabilistic data structure that can estimate the frequency of items in a stream. It is an improvement over Hyperloglog. While hyperloglog can estimate the number of unique items in a fixed amount of data, count mi...
Join discussion
Feb 2, 2024 · 8 min read · Calculating the exact number of distinct items in a collection can be a difficult task if the collection is very large or if you have a very limited amount of memory. Typical approaches can be: using a hash map (uses more memory) using a bit map (u...
Join discussion
Dec 14, 2023 · 2 min read · It is a probabilistic space-efficient data structure with O(1) insertion and retrieval. It is used to find if a key exists (with false positives) or not (no false negatives). It can be used as a data layer to check if a key exists before querying the...
Join discussion
Apr 9, 2023 · 4 min read · Before diving into the implementation of the bloom filters data structure, I highly recommend reading my article on the "What, Why, and How" of bloom filters. You can find the link to the article here. Main components required for Bloom filters imple...
Join discussion
Jul 19, 2022 · 12 min read · If you have a glass-protected bookshelf, it will protect your books from dust and insects. However, it will cost you more time to access the books when you need them, since you first need to slide or open the glass before you can get the books. Then ...
Join discussion