Image: onatm.dev
Onat Yigit Mercan posted a great explainer on Bloom filters, a data structure used as a sort of fuzzy hash map for membership of collections. The filters can be used to query if items are in a large database without using large amounts of memory. For example, a database of 1 million entries can use a bloom filter of just 1.14MB.
Source:
