You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently sbt_search check for presence in the internal Bloom Filters for each hash in the query MinHash. What if we load the hashes in a BF first, and then do BF/BF comparisons instead?
(this is somewhat premature optimization, but since we are seeing bigger signatures with small scaled arguments it might be worth to try)
The text was updated successfully, but these errors were encountered:
Currently
sbt_search
check for presence in the internal Bloom Filters for each hash in the query MinHash. What if we load the hashes in a BF first, and then do BF/BF comparisons instead?(this is somewhat premature optimization, but since we are seeing bigger signatures with small
scaled
arguments it might be worth to try)The text was updated successfully, but these errors were encountered: