Sciweavers

27 search results - page 2 / 6
» Maintaining variance and k-medians over data stream windows
Sort
View
DC
2008
13 years 10 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch
STACS
2010
Springer
14 years 4 months ago
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...
Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung...
PODC
2006
ACM
14 years 3 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
STACS
2007
Springer
14 years 3 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
ADC
2010
Springer
266views Database» more  ADC 2010»
13 years 4 months 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...