Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems

  • Hojjat Jafarpour
  • Bijit Hore
  • Sharad Mehrotra
  • Nalini Venkatasubramanian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5346)


In this paper we address the problem of subsumption checking for subscriptions in pub/sub systems. We develop a novel approach based on negative space representation for subsumption checking and provide efficient algorithms for subscription forwarding in a dynamic pub/sub environment. We then provide heuristics for approximate subsumption checking that greatly enhance the performance without compromising the correct execution of the system and only adding incremental cost in terms of extra computation in brokers. We illustrate the advantages of this novel approach by carrying out extensive experimentation.


Publish/Subscribe Subscription Subsumption Message-oriented middleware 


  1. 1.
    Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.-M.: The many faces of publish/subscribe. ACM Computing Surveys 35(2) (2003)Google Scholar
  2. 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)CrossRefGoogle Scholar
  3. 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)Google Scholar
  4. 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)Google Scholar
  5. 5.
    Shen, Z., Tirthapura, S.: Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves. In: Proceedings of IEEE ICDCS (2007)Google Scholar
  6. 6.
    Mühl, G.: Large-scale content-based publish/subscribe systems. Ph.D Dissertation, University of Darmstadt (September 2002)Google Scholar
  7. 7.
    Triantafillou, P., Economides, A.: Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems. In: Proceedings of ICDCS 2004, pp. 562–571 (2004)Google Scholar
  8. 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)Google Scholar
  9. 9.
    Carzaniga, A., Wolf, A.L.: Forwarding in a Content-Based Network. In: Proceedings of ACM SIGCOMM 2003, pp. 163–174 (2003)Google Scholar
  10. 10.
    Srivastava, D.: Subsumption and indexing in constraint query languages with linear arithmetic constraints. Annals of Mathematics and Artificial Intelligence 8, 315–343 (1992)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Costa, P., Picco, G.P.: Semi-Probabilistic Content-Based Publish-Subscribe. In: Proceedings of ICDCS 2005, pp. 575–585 (2005)Google Scholar
  12. 12.
    Castelli, S., Costa, P., Picco, G.P.: HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space. In: IEEE INFOCOM (2008)Google Scholar
  13. 13.
    Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD 1984, pp. 47–57 (1984)Google Scholar
  14. 14.
    Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)CrossRefzbMATHGoogle Scholar
  15. 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)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Hojjat Jafarpour
    • 1
  • Bijit Hore
    • 1
  • Sharad Mehrotra
    • 1
  • Nalini Venkatasubramanian
    • 1
  1. 1.Department of Computer ScienceUniversity of California at IrvineUSA

Personalised recommendations