BibTeX @INPROCEEDINGS{Charikar02findingfrequent, author = {Moses Charikar and Kevin Chen and Martin Farach-colton}, title = {Finding Frequent Items in Data Streams}, booktitle = {}, year = {2002}, pages = {693--703} } Abstract We present a 1-pass algorithm for estimating the most frequent items in a data stream using very limited storage space. Our method relies on a novel data structure called a


{{#tags}}- {{label}}
{{/tags}}