Supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems

Publish/subscribe systems are currently gaining increasing attention in both academia and industry. One of the reasons for this interest is the wide applicability, in theory, of these systems, ranging from low-level monitoring of distributed systems to high-level applications for e-commerce. Whereas several current research activities deal with extensions of the main publish/subscribe functionalities, this work concentrates on the basic principles and foundations of these systems. This different focus originates from the insufficiency, in our opinion, of current solutions.This paper describes the research problems identified by the author and tackled within the associated PhD thesis. In particular, the corresponding PhD thesis will investigate the suitability of publish/subscribe systems internally supporting conjunctive subscription languages for scenarios requiring more expressive, i.e., arbitrary Boolean, subscriptions. This paper is structured as follows: After giving the context of the work more precisely and introducing the required concepts and foundations, we motivate our research problems and state two condensed research questions. Afterwards, we present our results so far and conclude by describing further steps we want to take to answer the identified questions.

[1]  Sven Bittner,et al.  On the benefits of non-canonical filtering in publish/subscribe systems , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[2]  Hector Garcia-Molina,et al.  Query Merging: Improving Query Subscription Processing in a Multicast Environment , 2003, IEEE Trans. Knowl. Data Eng..

[3]  Alfonso Fuggetta,et al.  The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS , 2001, IEEE Trans. Software Eng..

[4]  Peter Triantafillou.  Content-based publish-subscribe over structured P2P networks , 2004, ICSE 2004.

[5]  Peter Pietzuch.  Hermes: A scalable event-based middleware , 2004 .

[6]  Robert E. Gruber,et al.  The architecture of the READY event notification service , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems. Workshops on Electronic Commerce and Web-based Applications. Middleware.

[7]  Annika Marie Hinze.  A-MEDIAS: concept and design of an adaptive integrating event notification service , 2003 .

[8]  Dennis Shasha,et al.  Filtering algorithms and implementation for very fast publish/subscribe systems , 2001, SIGMOD '01.

[9]  Lili Qiu,et al.  Summary-based routing for content-based event distribution networks , 2004, CCRV.

[10]  Gero Mühl,et al.  Large-scale content based publish, subscribe systems , 2002 .

[11]  Matthias Jarke,et al.  Query Optimization in Database Systems , 1984, CSUR.

[12]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[13]  Sven Bittner,et al.  A Detailed Investigation of Memory Requirements for Publish/Subscribe Filtering Algorithms , 2005, OTM Conferences.

[14]  Sven Bittner,et al.  Event distributions in online book auctions. , 2006 .

[15]  Ludger Fiege,et al.  Supporting Covering and Merging in Content-Based Publish/Subscribe Systems: Beyond Name/Value Pairs , 2001 .

[16]  Hans-Arno Jacobsen,et al.  Predicate matching and subscription matching in Publish/Subscribe systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[17]  Alejandro P. Buchmann,et al.  An active functionality service for e-business applications , 2002, SGMD.

[18]  Hans-Arno Jacobsen,et al.  A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[19]  Patrick Th. Eugster,et al.  Event systems. How to have your cake and eat it too , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[20]  Sven Bittner,et al.  Pruning subscriptions in distributed publish/subscribe systems , 2006, ACSC.

[21]  Pascal Felber,et al.  A scalable protocol for content-based routing in overlay networks , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[22]  Amy L. Murphy,et al.  Efficient content-based event dispatching in the presence of topological reconfiguration , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[23]  Hector Garcia-Molina,et al.  Index structures for selective dissemination of information under the Boolean model , 1994, TODS.

[24]  David S. Rosenblum,et al.  Achieving scalability and expressiveness in an Internet-scale event notification service , 2000, PODC '00.

[25]  Guruduth Banavar,et al.  An efficient multicast protocol for content-based publish-subscribe systems , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[26]  Alexander L. Wolf,et al.  A routing scheme for content-based networking , 2004, IEEE INFOCOM 2004.

[27]  Peter Triantafillou,et al.  Subscription summarization: a new paradigm for efficient publish/subscribe systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[28]  Helmut Veith,et al.  Efficient filtering in publish-subscribe systems using binary decision diagrams , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[29]  Sven Bittner,et al.  Subscription tree pruning: A structure-independent routing optimization for general-purpose publish/subscribe systems. , 2006 .

[30]  Sudarshan S. Chawathe,et al.  XPath queries on streaming data , 2003, SIGMOD '03.

[31]  Luís E. T. Rodrigues,et al.  A genetic algorithm for multicast mapping in publish-subscribe systems , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[32]  Eric N. Hanson,et al.  A predicate matching algorithm for database rule systems , 1990, SIGMOD '90.