-
Implement a Cuckoo Filter in DiceDB, introducing commands `CF.ADD`, `CF.EXISTS`, and `CF.DEL` for adding, checking existence, and deleting elements. A good alternative (for bloom) if a use case requir…
-
Our current inverted index impl. for sparse vector search processes all dimensions equally, leading to inefficient intersection operations, particularly when dealing with common dimensions that have v…
-
https://github.com/redis/redis/releases/tag/8.0-m01
New commands:
>- 7 new data structures: JSON, Time series, Bloom filter, Cuckoo filter, Count-min sketch, Top-k, t-digest
>- Redis scalable que…
-
## Description
This PR tracks progress on implementation of cuckoo filter for attribute retrieval with possibly higher execution speed performance path if attribute doesn't exist, as outlined in ht…
-
I found this on Reddit but I decided to post here because my comment got too long.
Disclaimer: I'm making https://github.com/fjall-rs/lsm-tree, so I have some experience with LSM-trees.
I don't …
-
https://lrita.github.io/2020/02/11/cuckoo-hashing-filter/
-
I'm trying to add string to the cuckoofilter library
https://github.com/efficient/cuckoofilter/blob/master/src/cuckoofilter.h
mycode
cuckoofilter::CuckooFilter cuckoo_mempool(total_items);
b…
-
Making trees to hold one item per 12.5 bits often fails. For instance, the constructor makes a filter of size 3 mebibytes when asked to construct a filter to hold 2,013,265 items, but this is too ambi…
-
### Suggestions for Improvement
@nothingmuch has suggested the following improvements in the pull request [#1](https://github.com/payjoin/cja/pull/1):
1. The `Filter` implementations rely on Blo…
-
### Bloom Filters:
A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set.
It can have false positives, but no false negatives. This …