Bloom Filter
| A Bloom filter is a data structure that is used to determine if an item is a part of a set or not. The way it works is by taking a group of items and hashing them into a set of values. These values are then stored in a bit array. When the Bloom filter is queried for an item, the item is hashed and the resulting hash value is used to check if the item is in the set. If the item is not in the set, the Bloom filter will return a negative result. |
Share this glosssary
