111 search results - page 4 / 23 » Maintaining Stream Statistics over Sliding Windows |
174
click to vote
SIGMOD
2006
ACM
15 years 10 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...
138
Voted
ICDE
2012
IEEE
13 years 9 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...
110
Voted
DASFAA
2010
IEEE
14 years 8 months ago
2010
IEEE
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
ALGORITHMICA
2004
14 years 10 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
KDD
2010
ACM
15 years 2 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...