128 search results - page 4 / 26 » Sketching probabilistic data streams |
PODS
2005
ACM
14 years 7 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
DIALM
2007
ACM
13 years 11 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
PODS
2010
ACM
14 years 16 days ago
2010
ACM