Findinding Top k Elements and Heavy Hitters in Data Streams



Friday, 27 July 2012, 15:00 to 16:30


  • A-212 (STCS Seminar Room)

Finding top k items  and finding heavy hitters in data streams are two well studied problems in streaming algorithms. We shall discuss two deterministic streaming algorithms, one for each of these two problems.

Reference: Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi: Efficient Computation of Frequent and Top-k Elements in Data Streams. ICDT 2005.