article

A simple algorithm for finding frequent elements in streams and bags

Authors:

Richard M. Karp,

Scott Shenker,

Christos H. PapadimitriouAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 28, Issue 1

Pages 51 - 55

https://doi.org/10.1145/762471.762473

Published: 01 March 2003 Publication History

Get Access

Abstract

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 θ.

References

[1]

Alon, N., Matias, Y., and Szegedy, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York.

Digital Library

Google Scholar

[2]

Beyer, K. S. and Ramakrishnan, R. 1999. Bottom-up computation of sparse and iceberg cubes. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, New York.

Digital Library

Google Scholar

[3]

Charikar, M., Chen, K., and Farach-Colton, M. 2002. Finding frequent items in data streams. In ICALP 2002. Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, Germany, 693--703.

Digital Library

Google Scholar

[4]

Demaine, E. D., Munro, J. I., and Lopez-Ortiz, A. 2002. Frequency estimation of internet packet streams with limited space. In European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, Germany.

Digital Library

Google Scholar

[5]

Estan, C. and Varghese, G. 2001. New directions in traffic measurement and accounting. In Proceedings of the SIGCOMM Internet Measurement Workshop. ACM, New York.

Digital Library

Google Scholar

[6]

Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., and Ullman, J. 1998. Computing iceberg queries efficiently. In Proceedings of the 24th International Conference on Very Large Data Bases, VLDB. Morgan-Kaufmann, San Mateo, Calif., 299--310.

Digital Library

Google Scholar

[7]

Gibbons, P. B. and Matias, Y. 1999. Synopsis data structures for massive data sets. In DIMACS: Series in Discrete Mathematics and Theoretical Computer Science: Special Issue on Eternal Memory Algorithms and Visualization, vol. A. AMS, Providence, R.I., 39--70.

Digital Library

Google Scholar

[8]

Pan, R., Breslau, L., Prabhakar, B., and Shenker, S. Approximate fairness through differential dropping. preprint, 2001.

Digital Library

Google Scholar

Cited By

View all

Ran DChen XSong L(2024)ComPipe: A Novel Flow Placement and Measurement Algorithm for Programmable Composite PipelinesElectronics10.3390/electronics1306102213:6(1022)Online publication date: 8-Mar-2024
https://doi.org/10.3390/electronics13061022
Lu JPan THe SMiao MZhou GQi YZhang SSong ESun XZhao HLyu BZhu S(2024)CloudSentry: Two-Stage Heavy Hitter Detection for Cloud-Scale Gateway Overload ProtectionIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.330185235:4(616-633)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TPDS.2023.3301852
Liu YXie X(2024)A Probabilistic Sketch for Summarizing Cold Items of Data StreamsIEEE/ACM Transactions on Networking10.1109/TNET.2023.331642632:2(1287-1302)Online publication date: May-2024
https://doi.org/10.1109/TNET.2023.3316426
Show More Cited By

Index Terms

A simple algorithm for finding frequent elements in streams and bags
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Physical data models

Recommendations

Finding recent frequent itemsets adaptively over online data streams
KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be changed as time goes by. Identifying the recent change of a data stream, ...
Frequent Elements with Witnesses in Data Streams
PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Detecting frequent elements is among the oldest and most-studied problems in the area of data streams. Given a stream of m data items in \1, 2, \dots, n\, the objective is to output items that appear at least d times, for some threshold parameter d, and ...
Search method of time sensitive frequent itemsets in data streams
CIARP'06: Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications

Recently, due to technical improvements of storage devices and networks, the amount of data increases rapidly. In addition, it is required to find the knowledge embedded in a data stream as fast as possible. Data stream is influenced by time. Therefore, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 28, Issue 1

March 2003

99 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/762471

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 2003

Published in TODS Volume 28, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

405
Total Citations
View Citations
3,313
Total Downloads

Downloads (Last 12 months)60
Downloads (Last 6 weeks)1

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ran DChen XSong L(2024)ComPipe: A Novel Flow Placement and Measurement Algorithm for Programmable Composite PipelinesElectronics10.3390/electronics1306102213:6(1022)Online publication date: 8-Mar-2024
https://doi.org/10.3390/electronics13061022
Lu JPan THe SMiao MZhou GQi YZhang SSong ESun XZhao HLyu BZhu S(2024)CloudSentry: Two-Stage Heavy Hitter Detection for Cloud-Scale Gateway Overload ProtectionIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.330185235:4(616-633)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TPDS.2023.3301852
Liu YXie X(2024)A Probabilistic Sketch for Summarizing Cold Items of Data StreamsIEEE/ACM Transactions on Networking10.1109/TNET.2023.331642632:2(1287-1302)Online publication date: May-2024
https://doi.org/10.1109/TNET.2023.3316426
Carvalho FFerreira RCunha ÍVieira MRamanathan M(2024)State Disaggregation for Dynamic Scaling of Network FunctionsIEEE/ACM Transactions on Networking10.1109/TNET.2023.328256232:1(81-95)Online publication date: Mar-2024
https://doi.org/10.1109/TNET.2023.3282562
Kakimura NNitta R(2024) Randomized counter-based algorithms for frequency estimation over data streams in space Theoretical Computer Science10.1016/j.tcs.2023.114317984(114317)Online publication date: Mar-2024
https://doi.org/10.1016/j.tcs.2023.114317
Liu ZDong FLiu CDeng XYang TZhao YLi JCui BZhang G(2024)WavingSketch: an unbiased and generic sketch for finding top-k items in data streamsThe VLDB Journal10.1007/s00778-024-00869-6Online publication date: 29-Jul-2024
https://doi.org/10.1007/s00778-024-00869-6
Kutzkov KWilliams BChen YNeville J(2023)LONE SAMPLERProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i7.26014(8413-8420)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i7.26014
Siddiqui TNarasayya VDumitru MChaudhuri S(2023)Cache-Efficient Top-k Aggregation over High Cardinality Large DatasetsProceedings of the VLDB Endowment10.14778/3636218.363622217:4(644-656)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.14778/3636218.3636222
Zhao FKhan PAgrawal DAbbadi AGupta ALiu Z(2023)Panakos: Chasing the Tails for Multidimensional Data StreamsProceedings of the VLDB Endowment10.14778/3583140.358314716:6(1291-1304)Online publication date: 20-Apr-2023
https://dl.acm.org/doi/10.14778/3583140.3583147
Chakraborti SZhang ZBertram NDing CDwarkadas SBlackburn SPetrank E(2023)Blast from the Past: Least Expected Use (LEU) Cache Replacement with Statistical HistoryProceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management10.1145/3591195.3595267(124-136)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591195.3595267
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Finding recent frequent itemsets adaptively over online data streams

Frequent Elements with Witnesses in Data Streams

Search method of time sensitive frequent itemsets in data streams

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Finding recent frequent itemsets adaptively over online data streams

Frequent Elements with Witnesses in Data Streams

Search method of time sensitive frequent itemsets in data streams

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations