StableBloomFilter

Implements the stable bloom filter from the paper by F. Deng and D. Rafiei. Approximately detecting duplicates for streaming data using stable bloom filters. In SIGMOD, pages 25–36, 2006.

We use heap storage (an array of Longs). This implies M=m*d can be set as high as about 125 giga-bits.

T: the type of funnel used
funnel: a Guava funnel for taking input
m: number of cells (see the paper, m is a Long but m/floor(63/d) must fit in a 32-bit Int)
d: bits per cell (see the paper, should lie in [1,63] but often set to 1, 2 or 3)
FPR: expected false positive rate (should lie in (0,1))

Linear Supertypes

Serializable, Serializable, Product, Equals, AnyRef, Any

Instance Constructors

new StableBloomFilter(funnel: Funnel[T], m: Long, d: Int, FPR: Double)

funnel
a Guava funnel for taking input
m
number of cells (see the paper, m is a Long but m/floor(63/d) must fit in a 32-bit Int)
d
bits per cell (see the paper, should lie in [1,63] but often set to 1, 2 or 3)
FPR
expected false positive rate (should lie in (0,1))

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
val FPR: Double

expected false positive rate (should lie in (0,1))
val K: Int

number of hash functions used
val M: Long

total memory required
val Max: Int

cell value to set upon insertion
val P: Int

number of cells to decrement on each insertion
def add(item: T): Boolean

Insert a stream element into the filter.
Insert a stream element into the filter.
item
the item to insert
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val d: Int

bits per cell (see the paper, should lie in [1,63] but often set to 1, 2 or 3)
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
val funnel: Funnel[T]

a Guava funnel for taking input
def get(i: Long): Long

Gets the current value of the i'th cell.
Gets the current value of the i'th cell.
i
the cell to get (in [0, m))
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
val hasher: HashFunction

murmur3 128 guava hashing function generator
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val m: Long

number of cells (see the paper, m is a Long but m/floor(63/d) must fit in a 32-bit Int)
number of cells (see the paper, m is a Long but m/floor(63/d) must fit in a 32-bit Int)
def merge(another: StableBloomFilter[T]): StableBloomFilter[T]

Merge another filter into this filter.
Merge another filter into this filter.
another
the other filter
def mightContain(item: T): Boolean

Return true if this SBF might contain the requested item.
Return true if this SBF might contain the requested item.
item
the item to check
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val random: Random

random number generator for decrementing cells
val storage: Array[Long]

heap storage for our bits
val storedBits: Int

number of bits used per unit storage
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val w: Int

number of longs used for storage
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object StableBloomFilter | package membership

case class StableBloomFilter[T](funnel: Funnel[T], m: Long, d: Int, FPR: Double) extends Product with Serializable

Instance Constructors

new StableBloomFilter(funnel: Funnel[T], m: Long, d: Int, FPR: Double)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val FPR: Double

val K: Int

val M: Long

val Max: Int

val P: Int

def add(item: T): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val d: Int

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

val funnel: Funnel[T]

def get(i: Long): Long

final def getClass(): Class[_]

val hasher: HashFunction

final def isInstanceOf[T0]: Boolean

val m: Long

def merge(another: StableBloomFilter[T]): StableBloomFilter[T]

def mightContain(item: T): Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val random: Random

val storage: Array[Long]

val storedBits: Int

final def synchronized[T0](arg0: ⇒ T0): T0

val w: Int

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped