69 search results - page 5 / 14 » Sketching asynchronous streams over a sliding window |
EDBT
2009
ACM
14 years 3 days ago
2009
ACM
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
PODS
2006
ACM
14 years 7 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 ...
ISAAC
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
SIGMOD
2006
ACM
14 years 7 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...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
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...