In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Thanaa M. Ghanem, Moustafa A. Hammad, Mohamed F. Mokbel, Walid G. Aref, and Ahmed K. Elmagarmid. "Incremental Evaluation of Sliding-window Queries over Data Streams". IEE...
Thanaa M. Ghanem, Moustafa A. Hammad, Mohamed F. M...
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, X...
We propose a novel approach based on predictive quantization (PQ) for online summarization of multiple time-varying data streams. A synopsis over a sliding window of most recent en...
Fatih Altiparmak, Ertem Tuncel, Hakan Ferhatosmano...