Time-decaying Bloom Filters for data streams with skewed distributions

Proceedings of the IEEE International Workshop on Research Issues in Data Engineering

Volumn , Issue , 2005, Pages 63-69

  Cheng, Kai ^a   Xiang, Limin ^a   Xu, Haiyan ^b   Iwaihara, Mizuho ^c   Mohania, Mukesh M ^d  

^a KYUSHU SANGYO UNIVERSITY   (Japan)

^b FUKUOKA INSTITUTE OF TECHNOLOGY   (Japan)

^c KYOTO UNIVERSITY   (Japan)

^d IBM INDIA RESEARCH LAB   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; DATA STREAMS; INTRUSION DETECTION; MULTI-SETS;

MATHEMATICAL MODELS; OPTIMIZATION; SENSITIVITY ANALYSIS; TELECOMMUNICATION TRAFFIC;

DATA STRUCTURES;

EID: 27144534828     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
2. R. S. Boyer and J. S. Moore. MJRTY: A Fast Majority Vote Algorithm, pages 105-118. Essays in Honor of Woody Bledsoe Automated Reasoning Series. Kluwer Academic Publishers, 1991.
3. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), pages 693-703, 2002.
4. K. Cheng and Y. Kambayashi. A semantic model for hypertext data caching. In Proceedings of the 21st International Conference on Conceptual Modeling, ER 2002, pages 276-290, Oct. 2002.
5. E. Cohen and M. Strauss. Maintaining time-decaying stream aggregates. In PODS 2003, pages 223-233, 2003.
6. S. Cohen and Y. Matias. Spectral Bloom Filters. In SIGMOD Conference, pages 241-252, 2003.
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 (TOCS), 21(3):270-313, 2003.
8. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary Cache: a Scalable Wide-Area Web Cache Sharing Protocol. In SIGCOMM 1998, pages 254-265, 1998.
9. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg queries efficiently. In Proceedings of the Twenty-fourth International Conference on Very Large Databases, pages 299-310, 1998.
10. M. Fischer and S. Salzberg. Finding a majority among n votes: Solution to problem 81-5. Journal of Algorithms, 3(4):376-379, 1982.
11. P. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, SIGMOD 1998, pages 331-342, 1998.
12. P. Gibbons and Y. Matias. Synopsis structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, A, 1999.
13. L. Golab and M. T. Ozsu. Issues in data stream management. SIGMOD Rec., 32(2):5-14, 2003.
14. Y. Kambayashi and K. Cheng. Capacity bound-free web warehouse. In M. Stonebraker, J. Gray, and D. Dewitt, editors, Proceedings of the First Biennial Conference on Innovative Data Systems Research, CIDR 2003, pages 47-57, 2003.
15. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In ICDE 2005, 2005. to appear.
16. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proceedings of 28th International Conference on Very Large Data Bases, VLDB 2002, pages 346-357, 2002.