Towards approximate event processing in a large-scale content-based network

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2011, Pages 790-799

  Zhao, Yaxiong ^a   Wu, Jie ^a  

^a Temple University   (United States)

Author keywords

Approximate event matching; Attribute constraint; Boolean expression; Content based publish subscribe

Indexed keywords

APPROXIMATE MATCHING; ATTRIBUTE CONSTRAINT; BOOLEAN EXPRESSIONS; CONTENT-BASED; CONTENT-BASED PUBLISH; CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS; CRITICAL COMPONENT; EVENT MATCHING; FALSE POSITIVE; FALSE POSITIVE RATES; HIERARCHICAL INDEXING; PERFORMANCE DEGRADATION; RANGE-BASED; REAL-WORLD APPLICATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 80051912483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2011.67     Document Type: Conference Paper

References (29)

1. "RTI Data Distribution Service (DDS)." [Online]. Available: http://www.rti.com/.
2. M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra, "Matching events in a content-based subscription system, " in Proc. of PODC'99. New York, NY, USA: ACM, 1999, pp. 53-61.
3. S. Bittner and A. Hinze, "The arbitrary boolean publish/subscribe model: making the case, " in Proc. of DEBS'07. New York, NY, USA: ACM, 2007, pp. 226-237. (Pubitemid 47281529)
4. L. Breslau, P. Cue, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and zipf-like distributions: Evidence and implications, " in proc. of INFOCOM'99. IEEE, 1999, pp. 126-134.
5. A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith, "Efficient filtering in publish-subscribe systems using binary decision diagrams, " in Proc. of ICSE'01. Washington, DC, USA: IEEE Computer Society, 2001, pp. 443-452. (Pubitemid 32485674)
6. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf, "Design and evaluation of a wide-area event notification service, " ACM Transactions on Computer Systems, vol. 19, no. 3, pp. 332-383, Aug. 2001. (Pubitemid 33619857)
7. A. Carzaniga and A. L. Wolf, "Content-based networking: A new communication infrastructure, " in NSF Workshop on an Infrastructure for Mobile and Wireless Systems, ser. Lecture Notes in Computer Science, no. 2538, Scottsdale, Arizona, oct 2001, pp. 59-68.
8. A. Carzaniga and A. L. Wolf, "Forwarding in a content-based network, " in Proc. of SIGCOMM'03. New York, NY, USA: ACM, 2003, pp. 163-174.
9. C. Chan, P. Felber, M. Garofalakis, and R. Rastogi, "Efficient filtering of xml documents with xpath expressions, " The VLDB Journal, vol. 11, no. 4, pp. 354-379, 2002. (Pubitemid 36191788)
10. P. Eugster, P. Felber, R. Guerraoui, and A. Kermarrec, "The many faces of publish/subscribe, " ACM Comput. Surv., vol. 35, no. 2, pp. 114-131, 2003.
11. F. Fabret, H. Jacobsen, F. Llirbat, J. Pereira, K. Ross, and D. Shasha, "Filtering algorithms and implementation for very fast publish/subscribe systems, " in Proc. of SIGMOD'01. ACM, 2001, pp. 115-126.
12. M. Fontoura, S. Sadanandan, J. Shanmugasundaram, S. Vassilvitski, E. Vee, S. Venkatesan, and J. Zien, "Efficiently evaluating complex boolean expressions, " in Proc. of SIGMOD'10. New York, NY, USA: ACM, 2010, pp. 3-14.
13. D. Guo, J. Wu, H. Chen, Y. Yuan, and X. Luo, "The dynamic bloom filters, " IEEE Trans. on Knowl. and Data Eng., vol. 22, pp. 120-133, January 2010.
14. H. Jafarpour, S. Mehrotra, N. Venkatasubramanian, and M. Montanari, "MICS: an efficient content space representation model for publish/subscribe systems, " in Proc. of DEBS'09. ACM, 2009, pp. 1-12.
15. H. Jafarpour, B. Hore, S. Mehrotra, and N. Venkatasubramanian, "Subscription subsumption evaluation for content-based publish/subscribe systems, " in Proc. of Middleware'08. New York, NY, USA: Springer-Verlag New York, Inc., 2008, pp. 62-81.
16. T. S. Jayram, S. Khot, R. Kumar, and Y. Rabani, "Cell-probe lower bounds for the partial match problem, " J. Comput. Syst. Sci., vol. 69, no. 3, pp. 435-447, 2004.
17. Z. Jerzak and C. Fetzer, "Bloom filter based routing for content-based publish/subscribe, " in Proc. of DEBS'08. ACM, 2008, pp. 71-81.
18. Z. Jerzak and C. Fetzer, "Prefix forwarding for publish/subscribe, " in Proc. of DEBS'07. New York, NY, USA: ACM, 2007, pp. 238-249. (Pubitemid 47281530)
19. S. Kale, E. Hazan, F. Cao, and J. P. Singh, "Analysis and algorithms for content-based event matching, " in Proc. of DEBS(ICDCSW)'05. Washington, DC, USA: IEEE Computer Society, 2005, pp. 363-369.
20. X. Li, Y. J. Kim, R. Govindan, and W. Hong, "Multi-dimensional range queries in sensor networks, " in Proc. of SenSys'03. NewYork, NY, USA: ACM, 2003, pp. 63-75. (Pubitemid 40682335)
21. A. M. Ouksel, O. Jurca, I. Podnar, and K. Aberer, "Efficient probabilistic subsumption checking for content-based publish/subscribe systems, " in Proc. of Middleware'06. New York, NY, USA: Springer-Verlag New York, Inc., 2006, pp. 121-140. (Pubitemid 46030563)
22. P. R. Pietzuch and J. M. Bacon, "Hermes: A distributed event-based middleware architecture, " Distributed Computing Systems Workshops, International Conference on, vol. 0, p. 611, 2002.
23. Z. Shen, S. Aluru, and S. Tirthapura, "Indexing for subscription covering in publish/subscribe systems, " in Proc. of PDCS'05. LasVegas, Nevada, USA: IEEE, 2005.
24. B. Stroustrup, The C++ Programming Language. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 2000.
25. S. Tarkoma and J. Kangasharju, "Optimizing content-based routers: posets and forests, " Distributed Computing, vol. 19, pp. 62-77, 2006. (Pubitemid 44290698)
26. P. Triantafillou and A. Economides, "Subscription summarization: A new paradigm for efficient publish/subscribe systems, " in Proc. of ICDCS'04, 2004, pp. 562-571.
27. S. E. Whang, H. Garcia-Molina, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, and R. Yerneni, "Indexing boolean expressions, " Proc. of VLDB Endow., vol. 2, no. 1, pp. 37-48, 2009.
28. T. W. Yan and H. García-Molina, "Index structures for selective dissemination of information under the boolean model, " ACM Trans. Database Syst., vol. 19, no. 2, pp. 332-364, 1994.
29. T. W. Yan and H. Garcia-Molina, "The SIFT information dissemination system, " ACM Trans. Database Syst., vol. 24, no. 4, pp. 529-565.