223 search results - page 17 / 45 » Approximate Frequency Counts over Data Streams |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
104
click to vote
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
155
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
107
click to vote
DIS
2009
Springer
15 years 4 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
90
Voted
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...