Skip to main content
SpringerLink
Log in

Generic Constraints for Content-Based Publish/Subscribe

  • Conference paper
  • First Online:
Cooperative Information Systems (CoopIS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2172))

Included in the following conference series:

Abstract

Publish/subscribe interaction enables the loosely coupled exchange of asynchronous notifications. Matching notifications to subscriptions and routing notifications from producers to interested consumers are the main problems in large-scale publish/subscribe systems. Content-based selection provides great flexibility because it allows to categorize notifications with respect to multiple dimensions but it also requires complex routing strategies. Previous work has tightly coupled content-based routing and matching algorithms to the constraints that can be used to select notifications of interest. This paper introduces the idea of generic constraints for content-based selection that are separated from the underlying matching and routing algorithms. Therefore, new constraints can be added easily. Moreover, this paper introduces the idea of filter merging that can improve the scalability of a notification service. Finally, we present novel algorithms for matching, covering, and merging.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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, 1999.

    Google Scholar 

  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, 1999.

    Google Scholar 

  3. J. Bates, J. Bacon, K. Moody, and M. Spiteri. Using events for the scalable federation of heterogeneous components. In Eighth ACM SIGOPS European Workshop: Support for Composing Distributed Applications, Sintra, Portugal, September 1998.

    Google Scholar 

  4. C. Bornhövd, M.A. Cilia, C. Liebig, and A.P. Buchmann. An infrastructure for meta-auctions. In Second International Workshop on Advance Issues of E-Commerce and Webbased Information Systems (WECWIS’00), San Jose, California, June 2000.

    Google Scholar 

  5. N. Carriero and D. Gelernter. Linda in context. CACM, 32(4):444–458, Apr. 1989.

    Google Scholar 

  6. A. Carzaniga, D. Rosenblum, and A. Wolf. Content-based addressing and routing: A general model and its application. Technical Report CU-CS-902-00, Department of Computer Science, University of Colorado, USA, 2000.

    Google Scholar 

  7. A. Carzaniga. Architectures for an Event Notification Service Scalable to Wide-area Networks. PhD thesis, Politecnico di Milano, Milano, Italy, December 1998.

    Google Scholar 

  8. 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), page 83, 2000.

    Google Scholar 

  9. G. Cugola, E. Di Nitto, and A. Fuggetta. Exploiting an event-based infrastructure to develop complex distributed systems. In Proceedings of the 1998 International Conference on Software Engineering, pages 261–270. IEEE Computer Society Press / ACM Press, 1998.

    Google Scholar 

  10. P. Eugster, R. Guerraoui, and J. Sventek. Type-based publish/subscribe. Technical Report DSC ID:200029, EPFL Lausanne, 2000.

    Google Scholar 

  11. F. Fabret, F. Llirbat, J. Pereira, and D. Shasha. Efficient matching for content-based publish/ subscribe systems. Technical report, INRIA, 2000.

    Google Scholar 

  12. L. Fiege and G. Mühl. Rebeca Event-Based Electronic Commerce Architecture, 2000. http://www.gkec.informatik.tu-darmstadt.de/rebeca.

  13. M, J. Franklin and S. B. Zdonik. “Data In Your Face”: Push Technology in Perspective. In Laura M. Haas and Ashutosh Tiwary, editors, SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA, pages 516–519. ACM Press, 1998.

    Google Scholar 

  14. K. Gough and G. Smith. Efficient recognition of events in distributed systems. In Proceedings of 18th Australasian Computer Science Conference (ACSC), February 1995.

    Google Scholar 

  15. E. N. Hanson, M. Chaabouni, C.-H. Kim, and Y.-W. Wang. A predicate matching algorithm for database rule systems. In 19 ACM SIGMOD Conf. on the Management of Data, Atlantic City, pages 271–280, May 1990.

    Google Scholar 

  16. L. Liu, C. Pu, and W. Tang. Continual queries for internet-scale event-driven information delivery. IEEE Knowledge and Data Engineering, 11(4):610–628, August 1999.

    Article  Google Scholar 

  17. L. Liu, C. Pu, W. Tang, and W. Han. Conquer: A continual query system for update monitoring in the wwww. International journal of Computer Systems, Science and Engineering, Special issue on Web semantics, 1999.

    Google Scholar 

  18. OMG. CORBA event service specification. OMG Document formal/94-01-01, 1994.

    Google Scholar 

  19. OMG. Corba notification service. OMG Document telecom/99-07-01, 1999.

    Google Scholar 

  20. B. Oki, M. Pfluegl, A. Siegel, and D. Skeen. The information bus-an architecture for extensible distributed systems. In Barbara Liskov, editor, Proc. of the 14th Symposium on Operating Systems Principles, pages 58–68, USA, December, 1993. ACM Press.

    Google Scholar 

  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, 2000.

    Chapter  Google Scholar 

  22. J. Pereira, F. Fabret, F. Llirbat, and D. Shasha. Efficient matching for web-based publish/ subscribe systems. In Opher Etzion and Peter Scheuermann, editors, Proc. of the Int. Conf. on Cooperative Information Systems (CoopIS), volume 1901 of LNCS. Springer, 2000.

    Google Scholar 

  23. B. Segall, D. Arnold, J. Boot, M. Henderson, and T. Phelps. Content based routing with Elvin4. In Proceedings AUUG2K, Canberra, Australia, June 2000.

    Google Scholar 

  24. N. Skarmeas and K. Clark. Content-based routing as the basis for intra-agent communication. In Proc. of the 5th Intern. Workshop on Intelligent Agents V: Agent Theories, Architectures, and Languages (ATAL-98), volume 1555 of LNAI, pp. 345–362, 1999. Springer.

    Article  Google Scholar 

  25. Sun. Distriubted event specification, 1998.

    Google Scholar 

  26. Sun. Java message service specification 1.0.2, 1999.

    Google Scholar 

  27. W. Tang. Scalable Trigger Processing and Change Notification in the Continual Query System. Oregon Graduate Institute, 1999.

    Google Scholar 

  28. TIBCO, Inc. Tib/Rendezvous. White Paper, 1996. http://www.rv.tibco.com/.

  29. J. Vitek, N. Horspool, A. Krall. Efficient type inclusion tests. ACM SIGPLAN Notices, vol. 32, pp. 142–157, Oct. 1997.

    Article  Google Scholar 

  30. M. Wray and R. Hawkes. Distributed virtual environments and VRML: An event-based architecture. In Proc. of the 7th Intern. WWW Conference, Brisbane, Australia, 1998.

    Google Scholar 

  31. T. W. Yan and H. Garcia-Molina. Index structures for selective dissemination of information under the Boolean model. ACM Trans. on Database Systems, 19(2):332–334, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Darmstadt University of Technology, Wilhelminenstr. 7, D-64283, Darmstadt, Germany

    Gero Mühl

Authors
  1. Gero Mühl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Systems and Computer Science, University of Rome “La Sapienza”, Via Salaria 113, 00198, Roma, Italy

    Carlo Batini  & Massimo Mecella  & 

  2. Department of Information and Communication Technology, University of Trento, Via Sommarive 14, 38050 Povo, Trento, Italy

    Fausto Giunchiglia

  3. Department of Mathematics, University of Trento, Via Sommarive 14, 38050 Povo, Trento, Italy

    Paolo Giorgini

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mühl, G. (2001). Generic Constraints for Content-Based Publish/Subscribe. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds) Cooperative Information Systems. CoopIS 2001. Lecture Notes in Computer Science, vol 2172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44751-2_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-44751-2_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42524-3

  • Online ISBN: 978-3-540-44751-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation