Memory Efficient Parallel Bloom Filters for String Matching

Bloom Filter is a fast and simple structure for string matching, but it allows false positives. Longest Prefix Matching Bloom Filters (LPM) with counter and extended fast hash table can eliminate false positives at the expense of double memory and none wire-speed. Faster searching speed can be achieved with Parallel LPMs (PLPM), using more memory. We present an algorithm named Memory Efficient Parallel Bloom Filters (MEPBF) which will save (q-1)/(2q) memory and reach nearly the same performance compared with PLPM of q LPMs. With this new algorithm, either faster searching speed can be achieved at given memory and strings or less memory is need at given speed and strings.