commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From GitBox <...@apache.org>
Subject [GitHub] [commons-collections] SilverNarcissus commented on issue #83: WIP: Initial bloom filter code contribution
Date Tue, 22 Oct 2019 01:12:44 GMT
SilverNarcissus commented on issue #83: WIP: Initial bloom filter code contribution
URL: https://github.com/apache/commons-collections/pull/83#issuecomment-544770518
 
 
   For checking whether an object is in the bloom filter. Assuming we hash the object by 4
hash functions and there result is 1, 2000, 8888, 10000,. We only need to check whether 1,
2000, 8888, 10000 bit location in the array is 1. Creating a new bloom filter we need 10000
bits extra space and we have to compare all bits of the two array. If we do the checking operation
10000 times per second, may be there is an huge overhead.

----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
 
For queries about this service, please contact Infrastructure at:
users@infra.apache.org


With regards,
Apache Git Services

Mime
View raw message