case class CMSInstance[K](countsTable: CountsTable[K], totalCount: Long, params: CMSParams[K]) extends CMS[K] with Product with Serializable
The general Count-Min sketch structure, used for holding any number of elements.
- Alphabetic
- By Inheritance
- CMSInstance
- Product
- Equals
- CMS
- CMSCounting
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new CMSInstance(countsTable: CountsTable[K], totalCount: Long, params: CMSParams[K])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(item: K, count: Long): CMSInstance[K]
Counts the item
counttimes and returns the result as a new sketch.Counts the item
counttimes and returns the result as a new sketch.- Definition Classes
- CMSInstance → CMSCounting
- def +(item: K): CMS[K]
Counts the item and returns the result as a new sketch.
Counts the item and returns the result as a new sketch.
- Definition Classes
- CMSCounting
- def ++(other: CMS[K]): CMS[K]
Returns a new sketch that is the combination of this sketch and the other sketch.
Returns a new sketch that is the combination of this sketch and the other sketch.
- Definition Classes
- CMSInstance → CMSCounting
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- val countsTable: CountsTable[K]
- val delta: Double
Returns the bound on the probability that a query estimate does NOT lie within some small interval (an interval that depends on
eps) around the truth.Returns the bound on the probability that a query estimate does NOT lie within some small interval (an interval that depends on
eps) around the truth.- Definition Classes
- CMS → CMSCounting
- def depth: Int
Number of hash functions (also: number of rows in the counting table).
Number of hash functions (also: number of rows in the counting table). This number is derived from
delta.- Definition Classes
- CMSCounting
- val eps: Double
Returns the one-sided error bound on the error of each point query, i.e.
Returns the one-sided error bound on the error of each point query, i.e. frequency estimate.
- Definition Classes
- CMS → CMSCounting
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def f1: Long
The first frequency moment is the total number of elements in the stream.
The first frequency moment is the total number of elements in the stream.
- Definition Classes
- CMSCounting
- def f2: Approximate[Long]
The second frequency moment is
\sum a_i^2, wherea_iis the count of the i-th element.The second frequency moment is
\sum a_i^2, wherea_iis the count of the i-th element.- Definition Classes
- CMS → CMSCounting
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def frequency(item: K): Approximate[Long]
Returns an estimate of the total number of times this item has been seen in the stream so far.
Returns an estimate of the total number of times this item has been seen in the stream so far. This estimate is an upper bound.
It is always true that
estimatedFrequency >= trueFrequency. With probabilityp >= 1 - delta, it also holds thatestimatedFrequency <= trueFrequency + eps * totalCount.- Definition Classes
- CMSInstance → CMSCounting
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def innerProduct(other: CMS[K]): Approximate[Long]
Let X be a CMS, and let count_X[j, k] denote the value in X's 2-dimensional count table at row j and column k.
Let X be a CMS, and let count_X[j, k] denote the value in X's 2-dimensional count table at row j and column k. Then the Count-Min sketch estimate of the inner product between A and B is the minimum inner product between their rows: estimatedInnerProduct = min_j (\sum_k count_A[j, k] * count_B[j, k]|)
- Definition Classes
- CMSInstance → CMSCounting
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def maxExactCount: Int
Number of exact counts a sparse CMS wants to keep.
Number of exact counts a sparse CMS wants to keep. This number is derived from
maxExactCountOpt.- Definition Classes
- CMSCounting
- val maxExactCountOpt: Option[Int]
An Option parameter about how many exact counts a sparse CMS wants to keep
An Option parameter about how many exact counts a sparse CMS wants to keep
- Definition Classes
- CMS → CMSCounting
- 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()
- val params: CMSParams[K]
- Definition Classes
- CMSInstance → CMS
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val totalCount: Long
Total number of elements counted (i.e.
Total number of elements counted (i.e. seen in the data stream) so far.
- Definition Classes
- CMSInstance → CMSCounting
- 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()
- def width: Int
Number of counters per hash function (also: number of columns in the counting table).
Number of counters per hash function (also: number of columns in the counting table). This number is derived from
eps.- Definition Classes
- CMSCounting