On Frequency Estimation and Detection of Heavy Hitters in Data Streams
A stream can be thought of as a very large set of data, sometimes even infinite, which arrives sequentially and must be processed without the possibility of being stored. In fact, the memory available to the algorithm is limited and it is not possible to store the whole stream of data which is inste...
Main Authors: | Federica Ventruto, Marco Pulimeno, Massimo Cafaro, Italo Epicoco |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-09-01
|
Series: | Future Internet |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-5903/12/9/158 |
Similar Items
-
Deterministic, Fast and Accurate Solution of the Heavy Hitters <italic>q</italic>-Tail Latencies Problem
by: Anna Fornaio, et al.
Published: (2022-01-01) -
UDDSketch: Accurate Tracking of Quantiles in Data Streams
by: Italo Epicoco, et al.
Published: (2020-01-01) -
On Frequency Estimation and Detection of Frequent Items in Time Faded Streams
by: Massimo Cafaro, et al.
Published: (2017-01-01) -
Deterministic heavy hitters with sublinear query time
by: Li, Yi, et al.
Published: (2018) -
On low-risk heavy hitters and sparse recovery schemes
by: Li, Yi, et al.
Published: (2018)