Modifier and Type | Class and Description |
---|---|
class |
FrequentAlgorithmImpl<T>
Stream based implementation of the "Frequent Algorithm" Implementation based
on: Methods for finding frequent items in data streams; Cormode et al; 2010
10.1007/s00778-009-0172-z
Original algorithm described in: A Simple Algorithm for Finding Frequent
Elements in Streams and Bags; Karp et al.; 2003 10.1145/762471.762473
|
class |
PointerBasedFrequentAlgorithmImpl<T,P> |
Modifier and Type | Interface and Description |
---|---|
interface |
LossyCounting<T>
A lossy bucket is a collection that implements lossy counting.
|
Modifier and Type | Class and Description |
---|---|
class |
LossyCountingBudgetImpl<T> |
class |
LossyCountingImpl<T>
Lossy bucket algorithm, based on: Approximate Frequency Counts over Data
Streams; Manku et al.; 2002;
|
class |
PointerBasedLossyCountingImpl<T,P> |
Modifier and Type | Class and Description |
---|---|
class |
PointerBasedSpaceSavingImpl<T,P> |
class |
SpaceSavingImpl<T>
Implementation of the SpaceSaving algorithm, based on: Methods for finding
frequent items in data streams; Cormode et al; 2010 10.1007/s00778-009-0172-z
Original algorithm: Efficient Computation of Frequent and Top-k Elements in
Data Streams; Metwally et.
|