39 search results - page 1 / 8 » Continuous monitoring of top-k queries over sliding windows |
SIGMOD
2003
ACM
14 years 4 months ago
2003
ACM
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...
SIGMOD
2006
ACM
14 years 4 months ago
2006
ACM
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...
EDBT
2011
ACM
12 years 8 months ago
2011
ACM
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...
ADC
2010
Springer
12 years 11 months ago
2010
Springer
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 ...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
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...