Fast data structure for small sets

Posted by thr on Stack Overflow See other posts from Stack Overflow or by thr
Published on 2010-04-11T17:32:31Z Indexed on 2010/04/11 17:33 UTC
Read the original article Hit count: 209

Filed under:
|
|
|

I'm in need for a data structure that can handle small sets (10-20 strings, at most 50, of varying length) very fast. False positives is ok, but false negatives are not.

The last requirement makes bloom filters seem like a good fit, but I'm not sure about their speed, any other recommendations?

© Stack Overflow or respective owner

Related posts about data-structures

Related posts about c#