45 search results - page 3 / 9 » Improved Approximate Detection of Duplicates for Data Stream... |
PODS
2003
ACM
14 years 4 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 ...
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 ...
KDD
2010
ACM
13 years 8 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...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
SIGMOD
2003
ACM
14 years 4 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...