10 search results - page 1 / 2 » Efficiently Monitoring Top-k Pairs over Sliding Windows |
ICDE
2012
IEEE
12 years 3 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
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...
PODS
2006
ACM
14 years 4 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
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 ...
KDD
2003
ACM
14 years 5 months ago
2003
ACM
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...