223 search results - page 9 / 45 » Approximate Frequency Counts over Data Streams |
103
click to vote
PODS
2006
ACM
15 years 9 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 ...
112
click to vote
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
73
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
174
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
83
Voted
CN
2008
14 years 9 months ago
2008
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...