204 search results - page 12 / 41 » Sketching Sampled Data Streams |
PODS
2010
ACM
14 years 18 days ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
SIGMOD
2003
ACM
14 years 7 months ago
2003
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. In ...
TEAA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Todays data stream management systems (DSMSs) lack security functionality. Based on adversary scenarios we show how a DSMS architecture can be protected. We sketch a gene...
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...