H-Tree: An efficient index structurefor event matching in content-basedpublish/subscribe systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 26, Issue 6, 2015, Pages 1622-1632

  Qian, Shiyou ^a   Cao, Jian ^a   Zhu, Yanmin ^a   Li, Minglu ^a   Wang, Jie ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b Stanford University   (United States)

Author keywords

Content based publish subscribe; event matching; index structure; matching time; performance

Indexed keywords

LARGE SCALE SYSTEMS;

CONTENT-BASED PUBLISH; EVENT MATCHING; INDEX STRUCTURE; MATCHING TIME; PERFORMANCE;

FORESTRY;

INDEXING; STRUCTURES; TREES;

EID: 84929330343     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2014.2323262     Document Type: Article

References (32)

1. P. Eugster, P. Felber, R. Guerraoui, and A. Kermarrec, "The many faces of publish/subscribe" Comput. Surv., vol. 35, no. 2, pp. 114-131, 2003
2. A. Carzaniga, D. Rosenblum, and A. Wolf, "Design and evaluation of a wide-area event notification service" ACM Trans. Comput. Syst., vol. 19, no. 3, pp. 332-383, 2001
3. P. Pietzuch and J. Bacon, "Hermes: A distributed event-based middleware architecture" in Proc. 22nd Int. Conf. Distrib. Comput. Syst. Workshops, 2002, pp. 611-618
4. F. Fabret, F. Llirbat, J. A. Pereira, I. Rocquencourt, and D. Shasha, "Efficient matching for content-based publish/subscribe systems" Tech. Rep., INRIA, pp.1-20, 2000
5. A. Rowstron, A. Kermarrec, M. Castro, and P. Druschel, "Scribe: The design of a large-scale event notification infrastructure" Netw. Group Commun., vol. 2243, pp. 30-43, 2001
6. G. Cugola, E. Di Nitto, and A. Fuggetta, "The JEDI event-based infrastructure and its application to the development of the OPSS WFMS" IEEE Trans. Softw. Eng., vol. 27, no. 9, pp. 827-850, Sep. 2001
7. IBM WebSphere MQ 7.5. IBM Corporation. (2012) [Online]. Available: http://www-01.ibm.com/software/integration/wmq/
8. TIBCO Rendezvous 8.3.0. (2010) [Online]. Available: http://www.tibco.com/products/automation/messaging/low-latency/rendezvo us/default.jsp
9. D. Raphaely, N. Bhatt, and C. Hall . (2007). Streams advanced queuing user's guide 11g release 1 (11.1) http://docs.oracle.com/cd/B28359-01/server.111/b28420.pdf
10. A. Cheung and H. Jacobsen, "Load balancing content-based publish/subscribe systems" ACM Trans. Comput. Syst., vol. 28, no. 4, p. 9, 2010
11. M. Aguilera, R. Strom, D. Sturman, M. Astley, and T. Chandra, "Matching events in a content-based subscription system" in Proc. ACM Symp. Principles Distrib. Comput., 1999, pp. 53-61
12. A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith, "Efficient filtering in publish-subscribe systems using binary decision diagrams" in Proc. 23rd Int. Conf. Softw. Eng., 2001, pp. 443-452
13. A. Carzaniga and A. Wolf, "Forwarding in a content-based network" in Proc. Conf. Appl., Technol., Archit., Protocols Comput. Commun., 2003, pp. 163-174
14. 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. SIGMOD Int. Conf. Manage. Data, 2001, pp. 115-126
15. M. Fontoura, S. Sadanandan, J. Shanmugasundaram, S. Vassilvitski, E. Vee, S. Venkatesan, and J. Zien, "Efficiently evaluating complex boolean expressions" in Proc. SIGMOD Int. Conf. Manage. Data, 2010, pp. 3-14
16. Y. Zhao and J. Wu, "Towards approximate event processing in a large-scale content-based network" in Proc. 22nd Int. Conf. Distrib. Comput. Syst. Workshops, 2011, pp. 790-799
17. S. Qian, J. Cao, Y. Zhu, M. Li, and J. Wang, "H-tree: An efficient index structure for event matching in publish/subscribe systems" in Proc. IEEE IFIP Netw. Conf., 2013, pp. 1-9
18. H. Jafarpour, S. Mehrotra, N. Venkatasubramanian, and M. Montanari, "MICS: An efficient content space representation model for publish/subscribe systems" in Proc. 3rd ACM Int. Conf. Distrib. Event-Based Syst., 2009, p. 7
19. S. Whang, H. Garcia-Molina, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, and R. Yerneni, "Indexing boolean expressions" Proc. VLDB Endowment, vol. 2, no. 1, pp. 37-48, 2009
20. G. Ashayer, H. Leung, and H. Jacobsen, "Predicate matching and subscription matching in publish/subscribe systems" in Proc. 22nd Int. Conf. Distrib. Comput. Syst. Workshops, 2002, pp. 539-546
21. M. Kratk, V. Snasel, P. Zezula, J. Pokorn, and T. Skopal, "Efficient processing of narrow range queries in the R-tree" Amphora Research Group, Dept. Comput. Sci., VSB-Tech. Univ. Ostrava, Ostrava, Czech Republic, Tech. Rep. ARG-TR-01-2004, 2004
22. R. Fisher, Statistical methods for research workers, Guwahati, India: Genesis Publishing Pvt Ltd, 1925
23. G. Zipf, "Relative frequency as a determinant of phonetic change" Harvard Studies Classical Philology, vol. 40, pp. 1-95, 1929
24. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and Zipf-like distributions: Evidence and implications" in Proc. IEEE Conf. Comput. Commun., 1999, pp. 126-134
25. Z. Jerzak and C. Fetzer, "Bloom filter based routing for contentbased publish/subscribe" in Proc. 2nd Int. Conf. Distrib. Event-Based Syst., 2008, pp. 71-81
26. P. Triantafillou and A. Economides, "Subscription summarization: A new paradigm for efficient publish/subscribe systems" in Proc. Int. Conf. Distrib. Comput. Syst., 2004, pp. 562-571
27. G. Li, S. Hou, and H. Jacobsen, "A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams" in Proc. 25th IEEE Int. Conf. Distrib. Comput. Syst., 2005, pp. 447-457
28. A. Ouksel, O. Jurca, I. Podnar, and K. Aberer, "Efficient probabilistic subsumption checking for content-based publish/subscribe systems" in Proc. 7th ACM/IFIP/USENIX Int. Conf. Middleware, 2006, pp. 121-140
29. K. Jayaram and P. Eugster, "Split and subsume: Subscription normalization for effective content-based messaging" in Proc. IEEE Int. Conf. Distrib. Comput. Syst., 2011, pp. 824-835
30. Z. Shen and S. Tirthapura, "Approximate covering detection among content-based subscriptions using space filling curves" J. Parallel Distrib. Comput., vol. 72, no. 12, pp. 1591-1602, 2012
31. Z. Liu, S. Parthasarthy, A. Ranganathan, and H. Yang, "Scalable event matching for overlapping subscriptions in pub/sub systems" in Proc. Int. Conf. Distrib. Event-Based Syst., 2007, pp. 250-261
32. X. Guo, J. Wei, and D. Han, "Efficient event matching in publish/subscribe: Based on routing destination and matching history" in Proc. Int. Conf. Netw., Archit., Storage, pp. 129-136 2008