Content-Based Publish/Subscribe Using Distributed R-Trees

  • Silvia Bianchi
  • Pascal Felber
  • Maria Gradinariu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4641)


Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network infrastructure. The challenge of such systems is to organize the peers so as to best match the interests of the consumers, minimizing false positives and avoiding false negatives.

In this paper, we propose and evaluate the use of R-trees for organizing the peers of a content-based routing network. We adapt three well-known variants of R-trees to the content dissemination problem striving to minimize the occurrence of false positives while avoiding false negatives. The effectiveness and accuracy of each structure is analyzed by extensive simulations.


False Positive False Negative Internal Node Minimum Bound Rectangle False Positive Ratio 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Eugster, P., Felber, P., Guerraoui, R., Kermarrec, A.M.: The many faces of publish/subscribe. ACM Computing Surveys 35(2), 114–131 (2003)CrossRefGoogle Scholar
  2. 2.
    Chand, R., Felber, P.: Semantic peer-to-peer overlays for publish/subscribe networks. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, Springer, Heidelberg (2005)Google Scholar
  3. 3.
    Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD, pp. 47–57. ACM Press, New York (1984)Google Scholar
  4. 4.
    Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD, ACM Press, New York (1990)Google Scholar
  5. 5.
    Bianchi, S., Datta, A.K., Felber, P., Gradinariu, M.: Stabilizing dynamic R-tree based spatial filters. In: Proceedings of 27th ICDCS (2007)Google Scholar
  6. 6.
    Perng, G., Wang, C., Reiter, M.: Providing content-based services in a peer-to-peer environment. In: Proceedings of 3rd DEBS, pp. 74–79 (2004)Google Scholar
  7. 7.
    Triantafillou, P., Aekaterinidis, I.: Content-based publish/subscribe over structured P2P networks. In: Proceedings of 3rd DEBS, pp. 104–109 (2004)Google Scholar
  8. 8.
    Anceaume, E., Gradinariu, M., Datta, A.K., Simon, G., Virgillito, A.: A semantic overlay for self-* peer to peer publish/subscribe. In: Proceedings of 26th ICDCS, p. 22 (2006)Google Scholar
  9. 9.
    Voulgaris, S., Riviere, E., Kermarrec, A.M., van Steen, M.: Sub-2-sub: Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In: Proceedings of 5th IPTPS (2006)Google Scholar
  10. 10.
    Aekaterinidis, I., Triantafillou, P.: Pastrystrings: A comprehensive content-based publish/subscribe DHT network. In: Proceedings of 26th ICDCS, p. 23 (2006)Google Scholar
  11. 11.
    Baldoni, R., Marchetti, C., Virgillito, A., Vitenberg, R.: Content-based publish-subscribe over structured overlay networks. In: Proceedings of 25th ICDCS, pp. 437–446 (2005)Google Scholar
  12. 12.
    Renesse, R., Bozdog, A.: Willow: DHT, aggregation, and publish/subscribe in one protocol. In: Proceedings of 3rd IPTPS (2004)Google Scholar
  13. 13.
    Choi, Y., Park, K., Park, D.: HOMED: a peer-to-peer overlay architecture for large-scale content-based publish/subscribe system. In: Proceedings of 3rd DEBS, pp. 20–25 (2004)Google Scholar
  14. 14.
    Gupta, A., Sahin, O.D., Agrawal, D., Abbadi, A.E.: Meghdoot: Content-based publish/subscribe over P2P networks. In: Proceedings of 5th Middleware (2004)Google Scholar
  15. 15.
    Terpstra, W., Behnel, S., Fiege, L., Zeidler, A., Buchmann, A.P.: A peer-to-peer approach to content-based publish/subscribe. In: Proceedings of 2nd DEBS, pp. 1–8 (2003)Google Scholar
  16. 16.
    Crespo, A., Buyukkokten, O., Garcia-Molina, H.: Query merging: Improving query subscription processing in a multicast environment. IEEE TKDE 15(1), 174–191 (2003)Google Scholar
  17. 17.
    Li, G., Hou, S., Jacobsen, H.: A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams. In: Proceedings of 25th ICDCS, pp. 447–457 (2005)Google Scholar
  18. 18.
    Ouksel, A., Jurca, O., Podnar, I., Aberer, K.: Efficient probabilistic subsumption checking for content-based publish/subscribe systems. In: Proceedings of 7th Middleware (2006)Google Scholar
  19. 19.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Silvia Bianchi
    • 1
  • Pascal Felber
    • 1
  • Maria Gradinariu
    • 2
  1. 1.University of NeuchâtelSwitzerland
  2. 2.LIP6, INRIA-Université Paris 6France

Personalised recommendations