61 search results - page 5 / 13 » Sketching asynchronous data streams over sliding windows |
100
Voted
PODS
2006
ACM
15 years 9 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 ...
161
click to vote
ICDE
2005
IEEE
15 years 10 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...
KDD
2010
ACM
15 years 1 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...
PODS
2003
ACM
15 years 9 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
170
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of efficient processing of continuous skyline que...