|We don't bite newbies here... much|
Re: Re: Bloom::Filter Usageby jreades (Friar)
|on Apr 20, 2004 at 16:12 UTC||Need Help??|
This is where things get very strange for me
Here's the code I'm running as a test:
it looks like one of these should have worked, but when I run my test code I always get the following:
It's just possible that there's something wrong with the module itself, and I've emailed the author asking for any tips or tricks but I haven't heard back from him/her yet.
And yes, I do think that the approach is pretty neat -- when someone suggested it and I did some reading it leapt out as a very low-cost way to perform a high-cost operation. And, as you said, even taking a fairly high false-positive rate of 0.1% you still end up with a tiny fraction of your original search space.
I did notice the odd bias towards email addresses but figured it might not affect what I was trying to do. What algorithm would you suggest as an alternative for working with 12-digit numeric keys more efficiently?