object BloomFilter
- Alphabetic
- By Inheritance
- BloomFilter
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[A](numEntries: Int, fpProb: Double)(implicit hash: Hash128[A]): BloomFilterMonoid[A]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def optimalNumHashes(numEntries: Int, width: Int): Int
- def optimalWidth(numEntries: Int, fpProb: Double): Option[Int]
- def sizeEstimate(numBits: Int, numHashes: Int, width: Int, approximationWidth: Double = 0.05): Approximate[Long]
Cardinality estimates are taken from Theorem 1 on page 15 of "Cardinality estimation and dynamic length adaptation for Bloom filters" by Papapetrou, Siberski, and Nejdl: http://www.softnet.tuc.gr/~papapetrou/publications/Bloomfilters-DAPD.pdf
Cardinality estimates are taken from Theorem 1 on page 15 of "Cardinality estimation and dynamic length adaptation for Bloom filters" by Papapetrou, Siberski, and Nejdl: http://www.softnet.tuc.gr/~papapetrou/publications/Bloomfilters-DAPD.pdf
Roughly, by using bounds on the expected number of true bits after n elements have been inserted into the Bloom filter, we can go from the actual number of true bits (which is known) to an estimate of the cardinality.
approximationWidth defines an interval around the maximum-likelihood cardinality estimate. Namely, the approximation returned is of the form (min, estimate, max) = ((1 - approxWidth) * estimate, estimate, (1 + approxWidth) * estimate)
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()