Sciweavers

143 search results - page 2 / 29
» Duplicate-Insensitive Order Statistics Computation over Data...
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
12 years 8 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
14 years 6 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
14 years 5 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
SSDBM
2005
IEEE
140views Database» more  SSDBM 2005»
13 years 11 months ago
Optimizing In-Order Execution of Continuous Queries over Streamed Sensor Data
The widespread use of sensor networks in scientific and engineering applications leads to increased demand on the efficient computation of the collected sensor data. Recent rese...
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmaga...
STACS
2010
Springer
14 years 11 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...