Analysis and algorithms for content-based event matching

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2005, Pages

  Kale, Satyen ^a   Hazan, Elad ^a   Cao, Fengyun ^a   Singh, Jaswinder Pal ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESSAGE PASSING; TREES (MATHEMATICS);

ANALYSIS EVALUATION; CONTENT-BASED; EVENT MATCHING; EVENT-BASED; GENERIC MODELING; LARGE SCALE EVENTS; MATCHING ALGORITHM; PUBLISH/SUBSCRIBE; PUBLISH/SUBSCRIBE SYSTEM; TREE-BASED ALGORITHMS;

PATTERN MATCHING;

EID: 85116416205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2005.40     Document Type: Conference Paper

References (12)

1. M. K. Aguilera, R. E. Strom, D. C. Sturman, M.Astley, and T. D. Chandra, “Matching events in a content-based subscription system,” In Eighteenth ACM Symp on Principles of Distributed Computing, 1999.
2. A. Bharambe, M. Agrawal, S. Seshan. “Mercury: Supporting Scalable Multi-Attribute Range Queries”. In Proc. ACM SIGCOMM, 2004
3. L. Breaslau, P. Cao, et al. “Web Caching and Zipf-like Distributions: Evidence and Implications”, In Proc. IEEE INFOCOM, 1999
4. A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith. “Efficient Filtering in Publish-Subscribe Systems Using Binary Decision Diagrams," in Proceedings of the 23rd International Conference on Software Engineering, pp. 443-452, Toronto, Canada, May 2001
5. A. Carzaniga, A.L. Wolf, “Forwarding in a Content-Based Network". In Proceedings of ACM SIGCOMM 2003.
6. M. Charikar, P. Indyk, R. Panigrahy, “New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching and Related Problems”, in Proceedings of the 29th International Colloquium on Automata Languages and Programming, (2002)
7. G. Cugola, E. Di Nitto, A. Fuggetta, “The JEDI Event-based Infrastructure and its Application to the Development of the OPSS WFMS”, in Proc. Of IEEE Trans. on Software Engineering, 2001.
8. F. Fabret, H. A. Jacobsen, et al. “Filtering algorithms and implementation for very fast publish/subscribe systems”. In Proc. ACM SIGMOD, 2001.
9. F. Fabret, F. Llirbat, et al. “Efficient matching for content-based publish/subscribe systems”. Technical report, INRIA. http://www.caravel.infira.fr/pereira/matching.ps.
10. T.S. Jayram, S. Khot, et al. “Cell-probe lower bounds for the partial match problem”. In Journal of Computer and System Sciences, Vol 69, Issue 3, 2004.
11. R. Rivest. “Partial match retrieval algorithms”. SIAM Journal on Computing, 5:19-50, 1976.
12. T. Yan and H. Garcia-Molina. “Index structures for selective dissemination of information under the Boolean model”. In ACM Trans. On Database Systems, 19(2):334-364, 1994.