11 search results - page 2 / 3 » CR-precis: A Deterministic Summary Structure for Update Data... |
PODS
2006
ACM
14 years 5 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 ...
SIGMETRICS
2011
ACM
12 years 7 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
ICDM
2009
IEEE
13 years 2 months ago
2009
IEEE
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
SSD
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time respons...