Finding frequent items over sliding windows with constant update time

DOI10.1016/J.IPL.2009.01.027zbMath1209.68661OpenAlexW2128785438MaRDI QIDQ991773

Regant Y. S. Hung, Lap-Kei Lee, Hing-Fung Ting

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.027

zbMATH Keywords

on-line algorithmsapproximation algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Approximating frequent items in asynchronous data stream over a sliding window ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows

Cites Work

• Unnamed Item
• Finding repeated elements
• CR-precis: A Deterministic Summary Structure for Update Data Streams
• An improved data stream summary: the count-min sketch and its applications

This page was built for publication: Finding frequent items over sliding windows with constant update time