Counting data stream based on Improved Counting Bloom Filter

Proceedings - The 9th International Conference on Web-Age Information Management, WAIM 2008

Volumn , Issue , 2008, Pages 512-519

  Yuan, Zhijian ^a   Miao, Jiajia ^a   Jia, Yan ^a   Wang, Le ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; BLOOMS (METAL); CHLORINE COMPOUNDS; DATA MINING; ELECTRIC NETWORK ANALYSIS; ERROR ANALYSIS; INFORMATION SCIENCE; LEARNING SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; RIVERS;

APPLICATIONS.; BLOOM FILTERING; BURST DETECTION; COUNTING DATA; DATA STREAMING; ERROR RATE; ERROR RATES; INTERNATIONAL CONFERENCES; RESEARCH COMMUNITIES; SIMULATION RESULTS; SPACE COMPLEXITIES; THEORETICAL ANALYSIS;

INFORMATION MANAGEMENT;

EID: 51849158796     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WAIM.2008.45     Document Type: Conference Paper

References (16)

1. Carney, D., et al., Monitoring streams: a new class of data management applications. Proceedings of the 28th international conference on Very Large Data Bases-Volume 28, 2002: p. 215-226.
2. Yunyue, Z. and S. Dennis. Efficient elastic burst detection in data streams. in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. 2003. Washington, D.C.: ACM Press.
3. Zhou, A., S. Qin, and W. Qian. Adaptively Detecting Aggregation Bursts in Data Streams. in Lecture Notes in Computer Science. 2005.
4. Moore, D., et al., Inferring Internet denial-ofservice activity. ACM Transactions on Computer Systems (TOCS), 2006. 24(2): p. 115-139.
5. Xin, Z. and S. Dennis. Better Burst Detection. in the 22nd International Conference on Data Engineering. 2006. Atlanta, Georgia, USA.
6. Chang, J.H. and W.S. Lee, Finding recent frequent itemsets adaptively over online data streams. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 2003: p. 487-492.
7. Babcock, B. and C. Olston, Distributed top-k monitoring. Proceedings of the 2003 ACM SIGMOD international conference on Management of data, 2003: p. 28-39.
8. Zhu, Y. and D. Shasha, StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time. Proceedings 2002 VLDB Conference, 2002.
9. Estan, C. and G. Varghese, New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice. ACM Transactions on Computer Systems, 2003. 21(3): p. 270-313.
10. Burton, H.B., Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970. 13(7): p. 422-426.
11. Cohen, S. and Y. Matias, Spectral bloom filters. Proceedings of the 2003 ACM SIGMOD international conference on Management of data, 2003: p. 241-252.
12. Aguilar-Saborit, J., et al., Dynamic count filters. ACM SIGMOD Record, 2006. 35(1): p. 26-32.
13. Fan, L., et al., Summary cache: a scalable widearea web cache sharing protocol. IEEE/ACM Transactions on Networking (TON), 2000. 8(3): p. 281-293.
14. Kumar, A., J. Xu, and J. Wang, Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement. Selected Areas in Communications, IEEE Journal on, 2006. 24(12): p. 2327-2339.
15. Broder, A. and M. Mitzenmacher, Network Applications of Bloom Filters: A Survey. Internet Mathematics, 2004. 1(4): p. 485-509.
16. Guo, D., H. Chen, and X. Luo, Theory and Network Application of Dynamic Bloom Filters. Proceedings of IEEE Infocom, 2006.