In this final post, we will provide a brief overview of the applications of Bloom filters and discuss their potential limitations.
Read More

In this post, we will implement a Bloom filter in C# and demonstrate its functionality through a concrete application: we will show how it can be used to quickly check if a URL is malicious.
Read More

In this post, we will formalize what we previously discussed and provide a precise definition of a Bloom filter. We will then delve into the mathematical principles behind it, focusing on the optimization of its parameters.
Read More

In this post, we will provide an informal introduction to Bloom filters using a simple analogy with a stamp collection.
Read More

In this post, we will briefly explore a concrete example where the techniques mentioned earlier fall short of fully addressing the problem. We will then discuss why a new solution is required.
Read More

In this post, we will explore various techniques for storing and querying massive amounts of data, with a particular emphasis on hashing.
Read More

Starting today, we are introducing a series on using Bloom filters for efficiently determining the existence of elements in large datasets. Our objective is to provide a comprehensive overview, exploring their necessity for scalable querying, analyzing their time complexity, and demonstrating a simple implementation in …
Read More

In this final post, we will briefly examine the strengths and weaknesses of n-gram models and explore why it may be necessary to refine them for improved predictions.
Read More

In this post, we will implement a simple n-gram model in C# using a limited corpus. This will highlight the key considerations to keep in mind when it comes to coding.
Read More

In this post, we will build on the concepts covered in the previous posts and explore how they can be applied to n-gram language models.
Read More