Introduction - If you have any usage issues, please Google them yourself
Such as the need to determine an element is not in a collection, we usually practice is to save all the elements, and then by comparing it is not in the collection, linked list, the tree is based on this idea, when the number of elements within the collection Larger, we need the space and time are linearly larger, more and more slow retri speed. Bloom filter uses a hash function to map an element to a point on an array of length m. When the point is 1, then the element is within the set, and vice versa. The disadvantage of this method is that when the detection of many elements may have a conflict, the solution is to use k hash function corresponding to k points, if all points are 1, then the element in the set, if 0, then the element Is not in the collection.