Lock-free Bloom-like probabilistic data structures implemented in C

271 views Asked by At

I'm writing variant of lock-free skiplist designed for multithreaded environment, and found that searching of none existent elements could be verified efficiently by applying Bloom filter-like data structure. In case of simply inserting elements into list lock-free Bloom filter as in link seems to be efficient, but this algorithm prohibits removal of elements. Counting Bloom filter or Chuchoo filter would suffice, but i'm not aware of them being implemented in c as lock-free algorithms.

Are there any lock-free probabilistic data structures similar to Bloom filter that tell if variable is a member of given set implemented in C?

0

There are 0 answers