• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Finding frequent items in data streams (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.rutgers.edu]
  • [www.cs.biu.ac.il]
  • [dns2.icar.cnr.it]
  • [staff.icar.cnr.it]
  • [www.cs.rutgers.edu]
  • [staff.icar.cnr.it]
  • [cs-www.cs.yale.edu]
  • [www.cs.yale.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [140.112.28.144]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Moses Charikar , Kevin Chen , Martin Farach-colton
Citations:340 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

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 count sketch, which allows us to estimate the frequencies of all the items in the stream. Our algorithm achieves better space bounds than the previous best known algorithms for this problem for many natural distributions on the item frequencies. In addition, our algorithm leads directly to a 2-pass algorithm for the problem of estimating the items with the largest (absolute) change in frequency between two data streams. To our knowledge, this problem has not been previously studied in the literature. 1

Keyphrases

data stream    frequent item    limited storage space    count sketch    novel data structure    space bound    item frequency    many natural distribution    1-pass algorithm    2-pass algorithm    method relies   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University