| Interface | Description |
|---|---|
| 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 |
| Frequent<T> |
Frequent algorithm.
|
| 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 © 2014. All rights reserved.