Two 2D search filters and their performance analyses

Abstract

Search filter is a special mechanism used to filter out the items outside the search space. 1D search filter configurates its hash space as one-dimensional bit array, while two-dimensional hash space is used by 2D search filter. For 2D search filters, there must be two independent sets of hash functions used to generate row and column addresses of a given key. In this research, we shall propose two new 2D search filters and compare them with 2D Random filter proposed by Tseng and Yang mathematically. Finally, we shall get the performance comparisons of these three 2D search filters.

Keywords:

• Search filter
• Bloom filter
• Random filter
• Random 2D filter
• Hash

C.R.Category:

• H.3.3