Efficient implementation of a Bloom filter in C?

c bloom-filter
Aman Deep Gautam picture Aman Deep Gautam · Jun 13, 2012 · Viewed 13.6k times · Source

This question has been asked previously but there was no answer for it at that time so I decided to ask it again.

I need an efficient implementation of a Bloom filter in C (not C++). If there is no such thing available, I would not mind implementing one, if given some good reference so that it doesn't take too much of my time.

I want to use this data structure for inserts and tests in a ratio (1:20k), so primarily it is test-intensive. The data to be tested is 64 bit integers.

Answer

Jyri J. Virkki picture Jyri J. Virkki · Feb 13, 2013

I have a stand-alone plain C library here which may be of use: https://github.com/jvirkki/libbloom

Related questions

How do I determine the size of my array in C?

How do I determine the size of my array in C? That is, the number of elements the array can hold?

Read More
How to initialize all members of an array to the same value?

I have a large array in C (not C++ if that makes a difference). I want to initialize all members of the same value. I could swear I once knew a simple way to do this. I could use memset() …

Read More
Convert char to int in C and C++

How do I convert a char to an int in C and C++?

Read More