[Dailydave] approximate string matching

[Mateusz Berezecki]

Hello Marty,

On 9/1/06, Martin Roesch <roesch at sourcefire.com> wrote:
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
>
> Have you taken a look at Bloom Filters?  I'm not sure what your exact
> requirements are but Bloom Filters are fast and do probabilistic
> pattern matching.  Check out:
>
> http://en.wikipedia.org/wiki/Bloom_filter
> http://www.arl.wustl.edu/~sarang/analysis.pdf
>
> They're easy to implement and fast, so maybe that will work for you.
> Hope that helps!

This looks like a good candidate for potential solution!
Thanks, I'll test this one for sure.


Mateusz