H-Tree: An efficient index structure for event matching in publish/subscribe systems

2013 IFIP Networking Conference, IFIP Networking 2013

Volumn , Issue , 2013, Pages

  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

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; EFFICIENCY; LARGE SCALE SYSTEMS; MESSAGE PASSING; PATTERN MATCHING;

ATTRIBUTE'S VALUE; CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS; DISTRIBUTED INFORMATION; EVENT MATCHING; FUNDAMENTAL COMPONENT; INDEX STRUCTURE; PERFORMANCE DEGRADATION; PUBLISH/SUBSCRIBE SYSTEM;

FORESTRY;

EXPERIMENTATION; FORESTRY; TREES;

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

References (25)

1. P. Eugster, P. Felber, R. Guerraoui, and A. Kermarrec, "The many faces of publish/subscribe, " Computing Surveys (CSUR), 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, " TOCS, vol. 19, no. 3, pp. 332-383, 2001.
3. P. Pietzuch and J. Bacon, "Hermes: A distributed eventbased middleware architecture, " in ICDCS Workshops. IEEE, 2002, pp. 611-618.
4. F. Fabret, F. Llirbat, J. Pereira, and D. Shasha, "Efficient matching for content-based publish/subscribe systems, " in Proc. CoopIS, 2000.
5. A. Rowstron, A. Kermarrec, M. Castro, and P. Druschel, "Scribe: The design of a large-scale event notification infrastructure, " Networked Group Communication, pp. 30-43, 2001.
6. G. Cugola, E. Di Nitto, and A. Fuggetta, "The jedi eventbased infrastructure and its application to the development of the opss wfms, " Software Engineering, IEEE Transactions on, vol. 27, no. 9, pp. 827-850, 2001.
7. A. Cheung and H. Jacobsen, "Load balancing contentbased publish/subscribe systems, " ACM Transactions on Computer Systems (TOCS), vol. 28, no. 4, p. 9, 2010.
8. M. Aguilera, R. Strom, D. Sturman, M. Astley, and T. Chandra, "Matching events in a content-based subscription system, " in PODC. ACM, 1999, pp. 53-61.
9. A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith, "Efficient filtering in publish-subscribe systems using binary decision diagrams, " in ICSE. IEEE, 2001, pp. 443-452.
10. A. Carzaniga and A. Wolf, "Forwarding in a contentbased network, " in SIGCOMM. ACM, 2003, pp. 163- 174.
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 SIGMOD. 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 SIGMOD. ACM, 2010, pp. 3-14.
13. Y. Zhao and J. Wu, "Towards approximate event processing in a large-scale content-based network, " in ICDCS. IEEE, 2011, pp. 790-799.
14. R. Fisher, Statistical methods for research workers. Genesis Publishing Pvt Ltd, 1925.
15. G. Zipf, "Relative frequency as a determinant of phonetic change, " Harvard Studies in Classical Philology, vol. 40, pp. 1-95, 1929.
16. H. Jafarpour, S. Mehrotra, N. Venkatasubramanian, and M. Montanari, "Mics: An efficient content space representation model for publish/subscribe systems, " in DEBS. ACM, 2009, p. 7.
17. S. Whang, H. Garcia-Molina, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, and R. Yerneni, "Indexing boolean expressions, " Proceedings of the VLDB Endowment, vol. 2, no. 1, pp. 37-48, 2009.
18. Z. Jerzak and C. Fetzer, "Bloom filter based routing for content-based publish/subscribe, " in DEBS. ACM, 2008, pp. 71-81.
19. P. Triantafillou and A. Economides, "Subscription summarization: A new paradigm for efficient publish/subscribe systems, " in ICDCS. IEEE, 2004, pp. 562-571.
20. 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 ICDCS. IEEE, 2005, pp. 447-457.
21. A. Ouksel, O. Jurca, I. Podnar, and K. Aberer, "Efficient probabilistic subsumption checking for contentbased publish/subscribe systems, " Middleware 2006, pp. 121-140, 2006.
22. K. Jayaram and P. Eugster, "Split and subsume: Subscription normalization for effective content-based messaging, " in ICDCS. IEEE, 2011, pp. 824-835.
23. X. Guo, J. Wei, and D. Han, "Efficient event matching in publish/subscribe: based on routing destination and matching history, " in NAS. IEEE, 2008, pp. 129-136.
24. A. Guttman, R-trees: A dynamic index structure for spatial searching. ACM, 1984, vol. 14, no. 2.
25. E. Hanson, M. Chaabouni, C. Kim, and Y. Wang, "A predicate matching algorithm for database rule systems, " SIGMOD, vol. 19, no. 2, pp. 271-280, 1990.