Writing a full-text search engine using Bloom filters

Re:Writing a full-text search engine using Bloom filters by ris on Tuesday December 24, 2013 @01:59PM (#6960626)

I'm wondering why not build a tree of bloom filters with a bit array at each level being the bitwise OR of its child nodes. Hashing only needs be done once, and a comparison happens at each level of the tree, which can be traversed to easily find matches whilst discarding branches that are certain to be fruitless.

A bit of googling shows me this already exists and is called a bloofi tree.

[ Parent | on HN ]

Re:Writing a full-text search engine using Bloom filters by yxhuvud on Wednesday December 25, 2013 @04:44AM (#6962702)

Then you are better at googling than I am. Can I enquire for a link?

Edit: nm, it appeared when I searched for bloom trees instead of bloofi

[ Parent | on HN ]