Timeline for Counting Bloom Filter
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 11, 2015 at 2:15 | history | edited | JS1 | CC BY-SA 3.0 |
added 270 characters in body
|
May 11, 2015 at 2:10 | history | edited | JS1 | CC BY-SA 3.0 |
added 270 characters in body
|
May 10, 2015 at 22:29 | history | edited | JS1 | CC BY-SA 3.0 |
Changed conclusion to leave it up to the OP to decide.
|
May 10, 2015 at 22:21 | history | edited | JS1 | CC BY-SA 3.0 |
added 2736 characters in body
|
May 10, 2015 at 12:03 | comment | added | SuperJedi224 | Alright, I decided to go with most of your original suggestion. | |
May 9, 2015 at 16:18 | comment | added | SuperJedi224 | And there doesn't seem to be a practical way to fix that that doesn't completely offset the time savings, so I changed it back. | |
May 9, 2015 at 16:06 | comment | added | SuperJedi224 | Darn, I forgot about that. | |
May 9, 2015 at 16:03 | comment | added | JS1 | Does it matter to you if there are duplicates in that array? If not, that is a good approach. I wrote my solution under the assumption that you only ever wanted to add maximum 1 to each bloom filter data slot per item inserted. | |
May 9, 2015 at 12:22 | comment | added | SuperJedi224 |
I decided to modify it so, instead of generating the entire temporary array, the hash method just generates an array of size bpe the indices at which the 1s would be located; and theinsert , contains and remove methods have been modified accordingly.
|
|
May 9, 2015 at 7:19 | history | answered | JS1 | CC BY-SA 3.0 |