A Bloom Filter implementation. More...
#include <cmath>
#include <limits.h>
#include "Common/StaticBuffer.h"
#include "Common/MurmurHash.h"
#include "Common/Logger.h"
#include "Common/StringExt.h"
Go to the source code of this file.
Classes | |
class | Hypertable::BasicBloomFilter< HasherT > |
A space-efficent probabilistic set for membership test, false postives are possible, but false negatives are not. More... | |
Namespaces | |
Hypertable | |
Hypertable definitions | |
Typedefs | |
typedef BasicBloomFilter | Hypertable::BloomFilter |
A Bloom Filter implementation.
A bloom filter is a probabilistic datastructure (see http://en.wikipedia.org/wiki/Bloom_filter). It's used in CellStores to speed up queries.
Definition in file BloomFilter.h.