132 search results - page 6 / 27 » Optimal approximations of the frequency moments of data stre... |
85
Voted
PAKDD
2007
ACM
15 years 3 months ago
2007
ACM
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...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
108
click to vote
ASIAN
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
108
Voted
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
111
click to vote
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
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...