News for hackers. Stuff that matters.
Re:Probabilistic Many-to-Many Relationships (with Bloom Filt... by SeoxyS on Friday August 31, 2012 @01:44PM (#4460792)
The benefit is not in the data set size, it's in performance of querying. 63ms vs. 0.03ms is a HUGE difference.
Re:Probabilistic Many-to-Many Relationships (with Bloom Filt... by nierman on Friday August 31, 2012 @03:02PM (#4461176)
or you could add an index to the join table and see a similar speedup without the accuracy tradeoff. I'm not saying that the approach doesn't have applications, but it would be much more useful if the post discussed a case that couldn't be addressed easily by standard means.