3 ms·
An alternative, but related, approach that would eliminate false positives could be to do an N-ary tree instead, where the bloom filter in this solution is just
by stormbrew 13y ago
An alternative, but related, approach that would eliminate false positives could be to do an N-ary tree instead, where the bloom filter in this solution is just the first level of the tree. You could then download a json document for the child of the matching top level element to narrow it down to specific documents. You could also calculate relevancies this way.
- ris 13y agoI'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.
- yxhuvud 13y agoThen 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