Filter Similarities in Content-Based Publish/Subscribe Systems

  • Gero Mühl
  • Ludger Fiege
  • Alejandro Buchmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2299)


Matching notifications to subscriptions and routing notifications from producers to interested consumers are the main problems in large-scale publish/subscribe systems.

Most previously proposed distributed notification services either use flooding or, if filtering is performed, they assume that each event broker has global knowledge about all active subscriptions. Both approaches degrade the scalability of notification services as the former wastes network resources and the latter generates overly large routing tables.

In this paper we describe content-based routing algorithms that exploit filter similarities in order to reduce the size of routing tables and the number of control messages that are exchanged among the brokers in order to keep the routing tables up-to-date. In particular, the proposed algorithms do not assume global knowledge about all active subscriptions. Furthermore, we describe how these optimizations can be supported if the underlying data and filter model is based on structured records.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Aguilera, R. Strom, D. Sturman, M. Astley, and T. Chandra. Matching events in a content-based subscription system. In PODC: 18th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 53–61, 1999.Google Scholar
  2. 2.
    G. Banavar, T. Chandra, B. Mukherjee, J. Nagarajarao, R. E. Strom, and D. C. Sturman. An efficient multicast protocol for content-based publish-subscribe systems. In Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, pages 262–272, 1999.Google Scholar
  3. 3.
    C. Bornhövd, M. Cilia, C. Liebig, and A. Buchmann. An infrastructure for metaauctions. In Second International Workshop on Advance Issues of E-Commerce and Web-based Information Systems (WECWIS’00), San Jose, California, June 2000.Google Scholar
  4. 4.
    A. Carzaniga. Architectures for an Event Notification Service Scalable to Widearea Networks. PhD thesis, Politecnico di Milano, Milano, Italy, Dec. 1998.Google Scholar
  5. 5.
    A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332–383, 2001.CrossRefGoogle Scholar
  6. 6.
    A. Crespo, O. Buyukkokten, and H. Garcia-Molina. Efficient query subscription processing in a multicast environment. In Proceedings of the 16th International Conference on Data Engineering (ICDE), 2000.Google Scholar
  7. 7.
    F. Fabret, A. Jacobsen, F. Llirbat, J. Pereira, K. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe. In SIGMOD 2001, pages 115–126, 2001.Google Scholar
  8. 8.
    L. Fiege and G. Mühl. Rebeca Event-Based Electronic Commerce Architecture, 2000.
  9. 9.
    L. Fiege, G. Mühl, and F. C. Gärtner. A modular approach to build structured event-based systems. In ACM Symposium on Applied Computing (SAC), 2002.Google Scholar
  10. 10.
    M. R. Garey and D. S. Johnson. Computers and Intractability A guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.zbMATHGoogle Scholar
  11. 11.
    P. Godfrey and J. Gryz. Answering queries by semantic caches. In Database and Expert Systems Applications (DEXA) LNCS Vol. 1677, pages 485–498. Springer, 1999.Google Scholar
  12. 12.
    A. Y. Halevy. Theory of answering queries using views. SIGMOD Record, 29, Dec. 2000.Google Scholar
  13. 13.
    Y. Huang and G.-M. Hector. Exactly-once semantics in a replicated messaging system. In Proc. of the 17th International Conference on Data Engeneering (ICDE), 2001.Google Scholar
  14. 14.
    Y. Huang and G.-M. Hector. Replicated condition monitoring. In Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), 2001.Google Scholar
  15. 15.
    A. M. Keller and J. Basu. A predicate-based caching scheme for client-server database architectures. VLDB Journal, 5(1):35–47, 1996.CrossRefGoogle Scholar
  16. 16.
    D. Lee and W. W. Chu. Conjunctive point predicate-based semantic caching for wrappers in web databases. In Workshop on Web Information and Data Management, 1998.Google Scholar
  17. 17.
    G. Mühl. Generic constraints for content-based publish/subscribe systems. In Proceedings of the 6th International Conference on Cooperative Information Systems (CoopIS), pages 211–225. Springer, 2001.Google Scholar
  18. 18.
    G. Mühl and L. Fiege. Supporting covering and merging in content-based publish/ subscribe systems: Beyond name/value pairs. IEEE Distributed Systems Online (DSOnline), 2(7), 2001.Google Scholar
  19. 19.
    G. Mühl, L. Fiege, and A. Buchmann. Evaluation of cooperation models for electronic business. In Information Systems for E-Commerce, Conference of German Society for Computer Science / EMISA, pages 81–94, Nov. 2000. ISBN 3-85487-194-5.Google Scholar
  20. 20.
    Object Management Group. Corba notification service. OMG Document telecom/99-07-01, 1999.Google Scholar
  21. 21.
    L. Opyrchal, M. Astley, J. Auerbach, G. Banavar, R. Strom, and D. Sturman. Exploiting ip multicast in content-based publish-subscribe systems. In J. Sventek and G. Coulson, editors, Middleware 2000, volume 1795 of LNCS, pages 185–207. Springer-Verlag, 2000.CrossRefGoogle Scholar
  22. 22.
    F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer, 1985.Google Scholar
  23. 23.
    W. Segall and D. Arnold. Elvin has left the building: A publish/subscribe notification service with quenching. In Proceedings of the 1997 Australian UNIX Users Group, Brisbane, Australia, September 1997., 1997.
  24. 24.
    A. C. Snoeren, K. Conley, and D. K. Gifford. Mesh-based content routing using xml. In 18th ACM Symposium on Operating System Principles, 2001.Google Scholar
  25. 25.
    J. D. Ullman. Information integration using logical views. In 6th Int. Conference on Database Theory; LNCS 1186, pages 19–40. LNCS 1186, Springer, 1997.Google Scholar
  26. 26.
    T. W. Yan and H. Garcia-Molina. Index structures for selective dissemination of information under the Boolean model. ACM Transactions on Database Systems, 19(2):332–334, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Gero Mühl
    • 1
  • Ludger Fiege
    • 1
  • Alejandro Buchmann
    • 1
  1. 1.Department of Computer ScienceDarmstadt University of TechnologyDarmstadt

Personalised recommendations