223 search results - page 3 / 45 » Approximate Frequency Counts over Data Streams |
ESCAPE
2007
Springer
13 years 12 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
PODS
2012
ACM
11 years 8 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
ICDE
2006
IEEE
14 years 7 months ago
2006
IEEE
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
ASIAN
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...