Location of Repository

Exact Pattern Matching with Feed-Forward Bloom Filters

By Iulian Moraru and David G. Andersen

Abstract

This paper presents a new, memory efficient and cacheoptimized algorithm for simultaneously searching for a large number of patterns in a very large corpus. This algorithm builds upon the Rabin-Karp string search algorithm and incorporates a new type of Bloom filter that we call a feed-forward Bloom filter. While it retains the asymptotic time complexity of previous multiple pattern matching algorithms, 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.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.185.3044
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.siam.org/proceeding... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.