Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fast Cache for Your Text: Accelerating Exact Pattern Matching with Feed-Forward Bloom
 

Summary: Fast Cache for Your Text: Accelerating Exact
Pattern Matching with Feed-Forward Bloom
Filters
Iulian Moraru and David G. Andersen
September 2009
CMU-CS-09-159
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
Abstract
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 the filtering speed can be as much as 5 higher than that of a normal Bloom filters.
This research was supported by grants from the National Science Foundation, Google, Network Appliance, Intel
Corporation and Carnegie Mellon Cylab.
Keywords: feed-forward Bloom filter, text scanning, cache efficient
1 Introduction

  

Source: Andersen, Dave - School of Computer Science, Carnegie Mellon University
Carnegie Mellon University, School of Computer Science

 

Collections: Computer Technologies and Information Sciences