case classTopPctLogic[K](heavyHittersPct: Double) extends HeavyHittersLogic[K] with Product with Serializable
Finds all heavy hitters, i.e., elements in the stream that appear at least (heavyHittersPct * totalCount) times.
Every item that appears at least (heavyHittersPct * totalCount) times is output, and with probability
p >= 1 - delta, no item whose count is less than (heavyHittersPct - eps) * totalCount is output.
This also means that this parameter is an upper bound on the number of heavy hitters that will be tracked: the set
of heavy hitters contains at most 1 / heavyHittersPct elements. For example, if heavyHittersPct=0.01 (or
0.25), then at most 1 / 0.01 = 100 items (or 1 / 0.25 = 4 items) will be tracked/returned as heavy hitters.
This parameter can thus control the memory footprint required for tracking heavy hitters.
Linear Supertypes
Serializable, Product, Equals, HeavyHittersLogic[K], Serializable, AnyRef, Any
Finds all heavy hitters, i.e., elements in the stream that appear at least
(heavyHittersPct * totalCount)
times.Every item that appears at least
(heavyHittersPct * totalCount)
times is output, and with probabilityp >= 1 - delta
, no item whose count is less than(heavyHittersPct - eps) * totalCount
is output.This also means that this parameter is an upper bound on the number of heavy hitters that will be tracked: the set of heavy hitters contains at most
1 / heavyHittersPct
elements. For example, ifheavyHittersPct=0.01
(or 0.25), then at most1 / 0.01 = 100
items (or1 / 0.25 = 4
items) will be tracked/returned as heavy hitters. This parameter can thus control the memory footprint required for tracking heavy hitters.