A modified algorithm based on the Bloom Filter

This paper presents a modified algorithm based on the Bloom Filter. Considering a set A of n elements, if a i is an element of A, then a i could be mapped to a part of the filter by some hash functions. Some eigenvalues are extracted from a i , and then all eigenvalues are combined into a whole: a i *. The a i * 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.