Sciweavers

39 search results - page 3 / 8
» On Concurrency Control in Sliding Window Queries over Data S...
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 5 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
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 ...
Lap-Kei Lee, H. F. Ting

Publication
431views
15 years 5 months ago
Incremental Evaluation of Sliding-window Queries over Data Streams
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...
PODS
2003
ACM
143views Database» more  PODS 2003»
14 years 5 months ago
Maintaining variance and k-medians over data stream windows
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...
ADC
2010
Springer
266views Database» more  ADC 2010»
13 years 15 days ago
Counting distinct objects over sliding windows
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...
TKDE
2008
155views more  TKDE 2008»
13 years 5 months ago
Incremental Maintenance of Online Summaries Over Multiple Streams
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...