Findinding Top k Elements and Heavy Hitters in Data Streams

by Mr Swagato Sanyal (School of Technology and Computer Science, TIFR)

Friday 27 Jul 2012, 15:00 → 16:30 Asia/Kolkata

A-212 (STCS Seminar Room) (Colaba Campus)

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.