The frequent items problem, under polynomial decay, in the streaming model

DOI10.1016/j.tcs.2010.04.029zbMath1196.68348OpenAlexW2019166081MaRDI QIDQ986537

Ofra Itzhaki, Ely Porat, Guy Feigenblat

Publication date: 11 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.029

zbMATH Keywords

streamingfrequency countpolynomial decay functions

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

Fingerprints for highly similar streams

Cites Work

• Finding repeated elements
• Improved algorithms for polynomial-time decay and time-decay with additive error
• An improved data stream summary: the count-min sketch and its applications
• Time-decaying sketches for sensor data aggregation
• Maintaining time-decaying stream aggregates
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item