New Algorithms for Heavy Hitters in Data Streams

This article discusses new algorithms for heavy hitters in data streams, addressing the challenge of identifying items with high occurrence frequency efficiently. It covers topics such as streaming models, guarantees for heavy hitters, optimal algorithms for different parameters, and the Misra-Gries

0 views • 37 slides