3 ms·
No, they are probabilistic data structures and it’s not immediately obvious to me how to use them effectively for search
by klysm 3y ago
No, they are probabilistic data structures and it’s not immediately obvious to me how to use them effectively for search
- dataangel 3y agoYou use bloom filtering to massively reduce the number of possible matching messages, then you do a regular text search on the remaining set.
- klysm 3y agoBut how do you actually index text with a single bloom filter?
- j16sdiz 3y agoYou don't. You put mail into buckets (using some hashes), and hands out the bloom filter for each bucket. It is better than downloading all mail, but it is nowhere near the speed I want my email search to be.
- klysm 3y agoAnd there is a bucket for each word? That seems like a lot of bloom filters