Exact Pattern Matching with Feed-Forward Bloom Filters

@inproceedings{Moraru2009ExactPM,
  title={Exact Pattern Matching with Feed-Forward Bloom Filters},
  author={Iulian Moraru and David G. Andersen},
  booktitle={ALENEX},
  year={2009}
}
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a feed-forward Bloom filter is also able to reduce the set of patterns needed for the exact matching phase. We show that this technique, along with a CPU architecture aware design of the Bloom filter, can provide speedups between 2× and 30×, and memory consumption reductions as large as 50× when compared with grep, while… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

SplitScreen: Enabling efficient, distributed malware detection

  • Journal of Communications and Networks
  • 2010
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Multiple Pattern Matching for Network Security Applications: Acceleration through Vectorization

  • 2017 46th International Conference on Parallel Processing (ICPP)
  • 2017
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Quotient Filters: Approximate Membership Queries on the GPU

  • 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
  • 2018
VIEW 2 EXCERPTS
CITES METHODS

A Fast and Accurate Hardware String Matching Module with Bloom Filters

  • IEEE Transactions on Parallel and Distributed Systems
  • 2017
VIEW 2 EXCERPTS
CITES METHODS

Bloom tree: A search tree based on Bloom filters for multiple-set membership testing

  • IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND