The Design and Implementation of Multi-dimensional Bloom Filter Storage Matrix

Abstract

Bloom filter is a bit array (a one-dimensional storage structure) that provides a compact representation for a set of data, which can be used to answer the membership query in an efficient manner with possible false positives. It has a lot of applications in many areas. In this paper, we further improve Bloom filter by proposing the use of multi-dimensional matrix to replace the one-dimensional structure. Based on our N-dimensional matrix structure, we propose four kinds of filter implementation, namely OFFF, ZFFF, WOFF, FFF (we refer it as Feng Filter). We prove that the false positive rate of our method is lower than the traditional one-dimensional Bloom filter. We also present the detailed implementation of our proposed filter. The traditional Bloom filter can be regarded as a special case of the Feng Filter.