A Bloom Filter with Checksums. More...
#include <cmath>#include <limits.h>#include "Common/Checksum.h"#include "Common/Filesystem.h"#include "Common/Logger.h"#include "Common/MurmurHash.h"#include "Common/Serialization.h"#include "Common/StaticBuffer.h"#include "Common/StringExt.h"#include "Common/System.h"

Go to the source code of this file.
Classes | |
| class | Hypertable::BasicBloomFilterWithChecksum< 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 BasicBloomFilterWithChecksum | Hypertable::BloomFilterWithChecksum |
A Bloom Filter with Checksums.
A bloom filter is a probabilistic datastructure (see http://en.wikipedia.org/wiki/Bloom_filter). It's used in CellStores to speed up database queries. This bloom filter stores additional checksums.
Definition in file BloomFilterWithChecksum.h.
1.8.8