An exact and O(1) time heaviest and lightest hitters algorithm for sliding-window data streams

Remous-Aris Koutsiamanis, Pavlos S. Efraimidis

In this work we focus on the problem of finding the heaviest-k and lightest-k hitters in a sliding window data stream. The most recent research endeavours have yielded an epsilon-a…