论文信息 - A simple algorithm for finding frequent elements in streams and bags

A simple algorithm for finding frequent elements in streams and bags

We present a simple, exact algorithm for identifying in a multiset the items with frequency more than a threshold θ. The algorithm requires two passes, linear time, and space 1/θ. The first pass is an on-line algorithm, generalizing a well-known algorithm for finding a majority element, for identifying a set of at most 1/θ items that includes, possibly among others, all items with frequency greater than θ.

[1] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.

[2] Rajeev Motwani,et al. Computing Iceberg Queries Efficiently , 1998, VLDB.

[3] Yossi Matias,et al. DIMACS Series in Discrete Mathematicsand Theoretical Computer Science Synopsis Data Structures for Massive Data , 2007 .

[4] Raghu Ramakrishnan,et al. Bottom-up computation of sparse and Iceberg CUBE , 1999, SIGMOD '99.

[5] R. Ramakrishnan,et al. Bottom-Up Computation of Sparse and Iceberg CUBEs , 1999, SIGMOD Conference.

[6] Cristian Estan,et al. New directions in traffic measurement and accounting , 2001, IMW '01.

[7] George Varghese,et al. New directions in traffic measurement and accounting , 2002, CCRV.

[8] Moses Charikar,et al. Finding frequent items in data streams , 2002, Theor. Comput. Sci..

[9] Scott Shenker,et al. Approximate fairness through differential dropping: (summary) , 2002, CCRV.

[10] Erik D. Demaine,et al. Frequency Estimation of Internet Packet Streams with Limited Space , 2002, ESA.

[11] Scott Shenker,et al. Approximate fairness through differential dropping , 2003, CCRV.

[12] Moses Charikar,et al. Finding frequent items in data streams , 2004, Theor. Comput. Sci..