System Design: Bloom Filter

Smartly transforming a hash table to a probabilistic data structure to trade accuracy for large memory gains

Introduction

Hash table is one of the most widely known and used data structures. With a wise choice of hash function, a hash table can produce optimal performance for insertion, search and deletion queries in constant time.

The main drawback of the hash table is potential collisions. To avoid them, one of the standard methods includes increasing the hash table size. While this …

accuracy bloom data data-structures design filter function hash memory microservices performance queries search software development system-design-concepts table trade wise