Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies

Authors:
Lukasz Golab;David DeHaan;Alejandro Lopez-Ortiz;Erik D. Demaine
Affiliations:
University of Waterloo, Canada;University of Waterloo, Canada;University of Waterloo, Canada;M.I.T., USA
Venue:
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Year:
2004

Citing 0
Cited 8

A simpler and more efficient deterministic scheme for finding frequent items over sliding windows

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adaptive shared-state sampling

Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Finding frequent items over sliding windows with constant update time

Information Processing Letters
Supporting top-k aggregate queries over unequal synopsis on internet traffic streams

APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Finding heavy hitters over the sliding window of a weighted data stream

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Querying sliding windows over online data streams

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Scalable identification and measurement of heavy-hitters

Computer Communications
Mining frequent items in data stream using time fading model

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm for identifying frequently occurring items within a sliding window of the last N items seen over an infinite data stream,given the following constraints.