37 search results - page 2 / 8 » A Fast Algorithm for Approximate Quantiles in High Speed Dat... |
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
ICDE
2006
IEEE
14 years 6 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...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...