Sciweavers

494 search results - page 20 / 99
» Approximate continuous querying over distributed streams
Sort
View
CIDR
2007
111views Algorithms» more  CIDR 2007»
13 years 9 months ago
Moirae: History-Enhanced Monitoring
In this paper, we investigate the benefits and challenges of integrating history into a near-real-time monitoring system; and present a general purpose continuous monitoring engi...
Magdalena Balazinska, YongChul Kwon, Nathan Kuchta...
WWW
2006
ACM
14 years 8 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 9 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
VLDB
2007
ACM
181views Database» more  VLDB 2007»
14 years 7 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
ICDE
2005
IEEE
173views Database» more  ICDE 2005»
14 years 9 months ago
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu