32 search results - page 1 / 7 » Finding Frequent Items over General Update Streams |
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popula...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
IPL
2010
13 years 3 months ago
2010
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
ESCAPE
2007
Springer
13 years 11 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...