A modified algorithm based on the Bloom Filter
Mai Jiang, Chunsheng Zhao, Xiang Gao · 2013
This paper presents a modified algorithm based on the Bloom Filter. Considering a set A of n elements, if aiis an element of A, then aicould be mapped to a part of the filter by some hash functions. Some eigenvalues are extracted from ai, and then all eigenvalues are combined into a whole: ai*. The ai* is mapped to another part of the filter by some hash functions too. This algorithm can greatly reduce the error rate of the Bloom Filter. The increased cost no matter in computing time and storage space is not high, and realization of the algorithm is easy.