List of usage examples for org.apache.hadoop.util.bloom Filter subclass-usage
From source file brickhouse.udf.bloom.BloomFilter.java
/**
* Implements a <i>Bloom filter</i>, as defined by Bloom in 1970.
* <p>
* The Bloom filter is a data structure that was introduced in 1970 and that has been adopted by
* the networking research community in the past decade thanks to the bandwidth efficiencies that it
* offers for the transmission of set membership information between networked hosts. A sender encodes
From source file org.apache.accumulo.core.bloomfilter.BloomFilter.java
/**
* Implements a <i>Bloom filter</i>, as defined by Bloom in 1970.
* <p>
* The Bloom filter is a data structure that was introduced in 1970 and that has been adopted by the networking research community in the past decade thanks to
* the bandwidth efficiencies that it offers for the transmission of set membership information between networked hosts. A sender encodes the information into a
* bit vector, the Bloom filter, that is more compact than a conventional representation. Computation and space costs for construction are linear in the number
From source file org.apache.accumulo.core.bloomfilter.DynamicBloomFilter.java
/**
* Implements a <i>dynamic Bloom filter</i>, as defined in the INFOCOM 2006 paper.
* <p>
* A dynamic Bloom filter (DBF) makes use of a <code>s * m</code> bit matrix but each of the <code>s</code> rows is a standard Bloom filter. The creation
* process of a DBF is iterative. At the start, the DBF is a <code>1 * m</code> bit matrix, i.e., it is composed of a single standard Bloom filter. It assumes
* that <code>n<sub>r</sub></code> elements are recorded in the initial bit vector, where <code>n<sub>r</sub> <= n</code> (<code>n</code> is the cardinality