-
Hello everyone, i am doing some research on the performance of the bloom filter, cuckoo filter and simd-block etc. And when i tried to compare the performance i found that the false positive rate of t…
-
From [this excellent blog post](http://mybiasedcoin.blogspot.com/2014/10/cuckoo-filters.html):
> If you want to avoid a technical discussion, all you need to know is that for reasonably large sized s…
-
**tl;dr:** A Cuckoo Filter provides similar functionality to a Bloom Filter with lower hashing overhead and deletion support.
**Add:** `public interface ProbablisticFilter`
**Add:** `public class Cuc…
-
Contains, as it stands, is an expensive routine. The default implementation in Link checks every page for the entry, and the Dict ones both always load one page minimum. For elements not in the struct…
-
Hey Dave,
Loving the Cuckoo Filter. Right now I am trying to figure out what the best strategy is to expand a Cuckoo Filter. Lets say my cuckoo Filter can take up to 1 million items max. Now once rea…
-
Hello there 👋
when I use a custom hash function and add many items in a loop, I receive the following error:
```
** (FunctionClauseError) no function clause matching in String.length/1
…
-
In the source code,I found
```
SubCF *filtersArray=CUCKOO_REALLOC(filter->filters, sizeof(*filtersArray) * (filter->numFilters + 1))' code.
```
Does this `filtersArray` after expapoint to…
-
Shoudl this become a library of probabilistic data structures?
For example, add Cuckoo filters. Then we would have
`probabalistic.bloomd` (or just bloom) and `probabalistic.cuckoo`
Could add o…
-
Hey,
I find it better in some aspects than bloom filters but I depend on storing it to a file and use it later.
Are you planing to add support for that in future? Do you see any technical probl…
l15k4 updated
7 years ago
-
## What
Filter data structures are smaller & faster than traditional sets.
Cuprate could use these over traditional sets (`HashSet`, `BTreeSet`) in cases where all we need to know is:
- Does the …