Sciweavers

34 search results - page 1 / 7
» Approximate Counts and Quantiles over Sliding Windows
Sort
View
PODS
2004
ACM
143views Database» more  PODS 2004»
14 years 5 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
STACS
2010
Springer
14 years 5 days 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...
ADC
2010
Springer
266views Database» more  ADC 2010»
13 years 7 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...
JCST
2008
175views more  JCST 2008»
13 years 5 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
STACS
2007
Springer
13 years 11 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