Finding top-k elements in data streams

Information Sciences

Volumn 180, Issue 24, 2010, Pages 4958-4974

  Homem, Nuno ^a   Carvalho, Joao Paulo ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Approximate algorithms; Data stream frequencies; Estimation; Most frequent; Top k algorithms

Indexed keywords

APPROXIMATE ALGORITHMS; COMMONLY USED; DATA STREAM; DATA-STREAM FREQUENCIES; ERROR ESTIMATES; INNOVATIVE ALGORITHMS; K ELEMENTS; LARGE POPULATION; MOST FREQUENT; NEAR-REAL TIME; SMALL MEMORY FOOTPRINT; STOCHASTIC BOUND; VOICE CALLS;

DATA COMMUNICATION SYSTEMS; FREQUENCY ESTIMATION; HYDRAULICS; SPEECH RECOGNITION;

ALGORITHMS;

EID: 77957681813     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2010.08.024     Document Type: Article

References (19)

1. D. Bertsekas Dynamic Programming and Optimal Control Vol. 1 1995 Athena Scientific
2. G. Cormode, S. Muthukrishnan. What's Hot and What's Not: TrackingMost Frequent Items Dynamically, in: Proceedings of the 22nd ACM PODS Symposium on Principles of Database Systems, Pages 296-306, 2003.
3. M. Datar, A. Gionis, P. Indyk, and R. Motwani Maintaining Stream Statistics Over Sliding Windows SIAM Journal on Computing 31 6 2002
4. E. Demaine, A. López-Ortiz, J. Munro. Frequency Estimation of Internet Packet Streams with Limited Space, in: Proceedings of the 10th ESA Annual European Symposium on Algorithms, Pages 348-360, 2002.
5. X. Dimitropoulos, P. Hurley, and A. Kind Probabilistic lossy counting: an efficient algorithm for finding heavy hitters ACM SIGCOMM Computer Communication Review 38 1 2008
6. C. Estan, G. Varghese. New directions in traffic measurement and accounting, in: Proceedings of SIGCOMM 2002 (2002), ACM Press. (Also: UCSD technical report CS2002-0699, February, 2002; available electronically).
7. C. Estan, and G. Varghese New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice ACM Transactions on Computer Systems 21 3 2003 270 313
8. C. Estan, G. Varghese, M. Fisk, Bitmap algorithms for counting active flows on high speed links. Technical Report CS2003-0738, UCSD, 2003.
9. L. Fan, P. Cao, J. Almeida, and A. Broder Summary cache: a scalable wide-area web cache sharing protocol IEEE/ACM Transactions on Networking 8 3 2000 281 293 10.1109/90.851975
10. P. Flajolet, and N. Martin Probabilistic counting algorithms for data base applications Journal of Computer and System Sciences 31 2 1985
11. T. Hu, S. Sung, H. Xiong, and Q. Fu Discovery of maximum length frequent itemsets Information Sciences 178 2008 69 87
12. N. Manerikar, and T. Palpanas Frequent items in streaming data: an experimental evaluation of the state-of-the-art Data & Knowledge Engineering 68 4 2009 415 430
13. G. Manku, R. Motwani. Approximate Frequency Counts over Data Streams, in: Proceedings of the 28th ACM VLDB International Conference on Very Large Data Bases, pages 346-357, 2002.
14. A. Metwally, D. Agrawal, A. Abbadi, Efficient Computation of Frequent and Top-k Elements in Data Streams, Technical Report 2005-23, University of California, Santa Barbara, 2005.
15. J. Misra, and D. Gries Finding repeated elements Science of Computer Programming 2 1982 143 152
16. S. Tanbeer, C. Ahmed, B. Jeong, and Y. Lee Efficient single-pass frequent pattern mining using a prefix-tree Information Sciences 179 5 2009 559 583
17. S. Tanbeer, C. Ahmed, B. Jeong, and Y. Lee Sliding window-based frequent pattern mining over data streams Information Sciences 179 22 2009 3843 3865
18. K. Whang, B. Vander-Zanden, and H. Taylor A linear-time probabilistic counting algorithm for database applications ACM Transactions on Database Systems 15 2 1990
19. J. Yu, Z. Chong, H. Lu, Z. Zhang, and A. Zhou A false negative approach to mining frequent itemsets from high speed transactional data streams Information Sciences 176 2006 1986 2015