Sciweavers

1552 search results - page 12 / 311
» Efficient Aggregate Computation over Data Streams
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff
PODS
2007
ACM
225views Database» more  PODS 2007»
14 years 7 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
ICDM
2006
IEEE
227views Data Mining» more  ICDM 2006»
14 years 1 months ago
Incremental Mining of Sequential Patterns over a Stream Sliding Window
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...
Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Le...
CIKM
2008
Springer
13 years 9 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 2 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