Subscription subsumption evaluation for content-based publish/subscribe systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5346 LNCS, Issue , 2008, Pages 62-81

  Jafarpour, Hojjat ^a   Hore, Bijit ^a   Mehrotra, Sharad ^a   Venkatasubramanian, Nalini ^a  

^a Irvine   (United States)

Author keywords

Messageoriented middleware; Publish sbscribe; Subscription sbsumption

Indexed keywords

EFFICIENT ALGORITHMS; INCREMENTAL COSTS; MESSAGEORIENTED MIDDLEWARE; PUB/SUB SYSTEMS; PUBLISH/SBSCRIBE; PUBLISH/SUBSCRIBE SYSTEMS; SUBSCRIPTION FORWARDING; SUBSCRIPTION SBSUMPTION; CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS; EXTRA COMPUTATIONS; INCREMENTAL COST; MESSAGE ORIENTED MIDDLEWARE; NEGATIVE SPACES; PUBLISH/SUBSCRIBE; SUBSCRIPTION SUBSUMPTION;

COMPUTATIONAL METHODS; COMPUTER SOFTWARE; ALGORITHMS;

MIDDLEWARE;

EID: 58049116394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89856-6_4     Document Type: Conference Paper

References (15)

1. Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.-M.: The many faces of publish/subscribe. ACM Computing Surveys 35(2) (2003)
2. Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and Evaluation of a Wide-Area Event Notification Service, ACM Transactions on Computer Systems 19(3), 332-383 (2001)
3. Ouksel, A.M., Jurca, O., Podnar, I., Aberer, K.: Efficient Probabilistic Subsumption Checking for Content-Based Publish/Subscribe Systems. In: Proceedings of Middleware 2006, pp. 121-140 (2006)
4. Li, G., Hou, S., Jacobsen, H.-A.: A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams. In: Proceedings of IEEE ICDCS 2005, pp. 447-457 (2005)
5. Shen, Z., Tirthapura, S.: Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves. In: Proceedings of IEEE ICDCS (2007)
6. Mühl, G.: Large-scale content-based publish/subscribe systems. Ph.D Dissertation, University of Darmstadt (September 2002)
7. Triantafillou, P., Economides, A.: Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems. In: Proceedings of ICDCS 2004, pp. 562-571 (2004)
8. Fabret, F., Jacobsen, H.A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish/subscribe systems. In: Proceedings of ACM SIGMOD 2001, pp. 115-126 (2001)
9. Carzaniga, A., Wolf, A.L.: Forwarding in a Content-Based Network. In: Proceedings of ACM SIGCOMM 2003, pp. 163-174 (2003)
10. Srivastava, D.: Subsumption and indexing in constraint query languages with linear arithmetic constraints. Annals of Mathematics and Artificial Intelligence 8, 315-343 (1992)
11. Costa, P., Picco, G.P.: Semi-Probabilistic Content-Based Publish-Subscribe. In: Proceedings of ICDCS 2005, pp. 575-585 (2005)
12. Castelli, S., Costa, P., Picco, G.P.: HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space. In: IEEE INFOCOM (2008)
13. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceeding's of ACM SIGMOD 1984, pp. 47-57 (1984)
14. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)
15. Moon, B., Jagadish, H.V., Faloutsos, C, Saltz, J.H.: Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. IEEE Trans. Knowl. Data Eng. 13(1), 124-141 (2001)