Sciweavers

63 search results - page 1 / 13
» Finding frequent items in data streams
Sort
View
VLDB
2010
ACM
144views Database» more  VLDB 2010»
13 years 2 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
14 years 5 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
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...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
PVLDB
2008
105views more  PVLDB 2008»
13 years 3 months ago
Finding frequent items in data streams
Graham Cormode, Marios Hadjieleftheriou
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 4 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 4 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
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 ...
Lap-Kei Lee, H. F. Ting