10 search results - page 1 / 2 » Space-efficient Relative Error Order Sketch over Data Stream... |
ICDE
2006
IEEE
14 years 5 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...
TKDE
2010
13 years 2 months ago
2010
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
EDBT
2004
ACM
14 years 4 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) ...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
ADC
2010
Springer
12 years 11 months ago
2010
Springer
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...