Sciweavers

223 search results - page 11 / 45
» Approximate Frequency Counts over Data Streams
Sort
View
86
Voted
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
15 years 4 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
PODS
2003
ACM
143views Database» more  PODS 2003»
15 years 9 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
15 years 6 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
15 years 3 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
15 years 9 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...