Sciweavers

84 search results - page 3 / 17
» Approximate quantiles and the order of the stream
Sort
View
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
13 years 9 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
14 years 5 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
PODS
2009
ACM
110views Database» more  PODS 2009»
14 years 5 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 5 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
LATIN
2004
Springer
13 years 10 months ago
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
Graham Cormode, S. Muthukrishnan