Andrea Iaconoandreaiacono.hashnode.dev·Feb 2, 2024Introduction to HyperLogLogCalculating 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...data structures
Surabhi Sumansurabhisuman.in·Dec 14, 2023Understanding Bloom FilterIt 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...Databases
satish Mishratechtonics.hashnode.dev·Apr 9, 2023Implementing Bloom Filters in Python and Understanding its error probability: A Step-by-Step GuideBefore 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...43 readsPython
Ahmed Shamimahmedshamim.hashnode.dev·Jul 19, 2022Probabilistic Data Structures: Bloom filterIf 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 ...1 like·133 readsalgorithms
