Interface | Description |
---|---|
ISampleSet<T> | |
ITopK<T> |
Class | Description |
---|---|
ConcurrentStreamSummary<T> |
Based on the Space-Saving algorithm and the Stream-Summary
data structure as described in:
Efficient Computation of Frequent and Top-k Elements in Data Streams
by Metwally, Agrawal, and Abbadi
Ideally used in multithreaded applications, otherwise see
StreamSummary |
Counter<T> | |
SampleSet<T> | |
ScoredItem<T> | |
StochasticTopper<T> |
Estimates most frequently occurring items in a data stream
using a bounded amount of memory.
|
StreamSummary<T> |
Based on the Space-Saving algorithm and the Stream-Summary
data structure as described in:
Efficient Computation of Frequent and Top-k Elements in Data Streams
by Metwally, Agrawal, and Abbadi
|
Copyright © 2019. All rights reserved.