Sciweavers

Share
39 search results - page 1 / 8
» Continuous monitoring of top-k queries over sliding windows
Sort
View
SIGMOD
2003
ACM
209views Database» more  SIGMOD 2003»
12 years 8 months ago
Distributed Top-K Monitoring
The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumenta...
Brian Babcock, Chris Olston
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
12 years 8 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
EDBT
2011
ACM
209views Database» more  EDBT 2011»
10 years 11 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...
ADC
2010
Springer
266views Database» more  ADC 2010»
11 years 3 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...
STACS
2010
Springer
12 years 3 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...
books