Skip to content

Comment on SeenBefore: A search engine for what you have seen beforeparent

Comments

Why not use a bloom filter?

The main benefit of Bloom filters is that they can be made small. Given that his database takes only 70MB or so and he's not trying to ship this to devices that might have much in terms of space limitations, there would appear to be little point.

Eh, true, I guess redis is sufficiently awesome.

Maybe because of this fact (according to Wikipedia)?: "The more elements that are added to the set, the larger the probability of false positives."

That depends on its size, though. You can make it larger and get fewer false positives.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.