3 hash functions to best hash sliding window strings for a bloom filter with minimum collisions

Posted by Duaa on Stack Overflow See other posts from Stack Overflow or by Duaa
Published on 2011-01-09T20:27:21Z Indexed on 2011/01/09 20:53 UTC
Read the original article Hit count: 278

Filed under:

Hi all:

I need 3 hash functions to hash strings of a sliding window moving over a text, to be used later to search within a bloom vector. I'm using C# in my programming

I read something about rolling hash functions and cyclic polynomials, they are used for sliding window applications. But really, I did not find any codes, they are just descriptions

So please, if anyone have any idea about 3 best C# hash functions to use with sliding window strings of fixed size (5-char), that consume less time and have minimum number of collisions, either they are rolling hash functions or others, please help me with some C# codes or links to hash functions names

Duaa

© Stack Overflow or respective owner

Related posts about c#