File this under tools I bet I’ll need:
Excerpt:
A Bloom Filter is a probabilistic data structure that is used to test whether an element is a member of a set, or more simply, it’s an incredibly space efficient hash table that is often used as a first line of defense in high performance caches.
Prometheus Fusion Perfection 
Leave a Reply