Sciweavers

128 search results - page 3 / 26
» Sketching probabilistic data streams
Sort
View
DC
2008
13 years 6 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch
LATIN
2004
Springer
13 years 11 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
ICDE
2006
IEEE
210views Database» more  ICDE 2006»
14 years 7 months ago
Fractal Modeling of IP Network Traffic at Streaming Speeds
This paper describes how to fit fractal models, online, on IP traffic data streams. Our approach relies on maintaining a sketch of the data stream and fitting straight lines: it y...
Flip Korn, S. Muthukrishnan, Yihua Wu
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 6 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 1 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra