A fast and anti-matchability matching algorithm for content-based publish/subscribe systems

Abstract The content-based publish/subscribe system is a flexible many-to-many communication middleware that meets the demands of many large-scale distributed applications. It is well known that event matching is a fundamental component of the content-based publish/subscribe system. When designing matching algorithms, matching speed is a major objective being pursued. Moreover, through theoretical analysis and experimental verification, we discover that the matching speed of most existing matching algorithms is affected by the subscriptions’ matchability which is defined as the matching probability of subscriptions with events. Nevertheless, this problem has not been considered in existing matching algorithms. To address this problem, we propose REIN (REctangle INtersection), a fast and anti-matchability matching algorithm for content-based publish/subscribe systems. REIN is a fast matching algorithm, following the conventional design objective of pursuing a high matching speed. Furthermore, due to the utilization of a negative searching strategy that aims to filter out unmatching subscriptions in the matching process, the matching speed of REIN is not affected by the subscriptions’ matchability, but rather is improved. To evaluate the performance of REIN, comprehensive experiments are conducted. The experiment results show that REIN not only has an excellent matching performance, but also possesses a beneficial anti-matchability feature.

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

[2]  Jie Wu,et al.  Towards Approximate Event Processing in a Large-Scale Content-Based Network , 2011, 2011 31st International Conference on Distributed Computing Systems.

[3]  Jianwei Yin,et al.  Parallel Matching Algorithms of Publish/Subscribe System , 2011, 2011 Eighth International Conference on Information Technology: New Generations.

[4]  Peter R. Pietzuch,et al.  Hermes: a distributed event-based middleware architecture , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[5]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[6]  Nalini Venkatasubramanian,et al.  Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems , 2008, Middleware.

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

[8]  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.

[9]  Marcos K. Aguilera,et al.  Matching events in a content-based subscription system , 1999, PODC '99.

[10]  Vijay K. Vaishnavi,et al.  Computing Point Enclosures , 1982, IEEE Transactions on Computers.

[11]  Kurt Rothermel,et al.  Distributed spectral cluster management: a method for building dynamic publish/subscribe systems , 2012, DEBS.

[12]  Hans-Arno Jacobsen,et al.  BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space , 2011, SIGMOD '11.

[13]  Kian-Lee Tan,et al.  An Efficient Publish / Subscribe Index for E-Commerce Databases Dongxiang , 2013 .

[14]  Alessandro Margara,et al.  High performance content-based matching using GPUs , 2011, DEBS '11.

[15]  Hans-Arno Jacobsen,et al.  Towards highly parallel event processing through reconfigurable hardware , 2011, DaMoN '11.

[16]  I. Jolliffe.  Principal Component Analysis , 2002 .

[17]  Nalini Venkatasubramanian,et al.  MICS: an efficient content space representation model for publish/subscribe systems , 2009, DEBS '09.

[18]  Srikanta Tirthapura,et al.  Approximate covering detection among content-based subscriptions using space filling curves , 2012, J. Parallel Distributed Comput..

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

[20]  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).

[21]  Karl Aberer,et al.  Efficient Probabilistic Subsumption Checking for Content-Based Publish/Subscribe Systems , 2006, Middleware.

[22]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[23]  Alexander L. Wolf,et al.  Forwarding in a content-based network , 2003, SIGCOMM '03.

[24]  Jun Wei,et al.  Efficient Event Matching in Publish/subscribe: Based on Routing Destination and Matching History , 2008, 2008 International Conference on Networking, Architecture, and Storage.

[25]  Amir H. Payberah,et al.  Vitis: A Gossip-based Hybrid Overlay for Internet-scale Publish/Subscribe Enabling Rendezvous Routing in Unstructured Overlay Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[26]  Hans-Arno Jacobsen,et al.  Parallel event processing for content-based publish/subscribe systems , 2009, DEBS '09.

[27]  Jun Wei,et al.  A Two-Phase Approach to Subscription Subsumption Checking for Content-Based Publish/Subscribe Systems , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[28]  Patrick Th. Eugster,et al.  Split and Subsume: Subscription Normalization for Effective Content-Based Messaging , 2011, 2011 31st International Conference on Distributed Computing Systems.

[29]  Sergei Vassilvitskii,et al.  Indexing Boolean Expressions , 2009, Proc. VLDB Endow..

[30]  Christof Fetzer,et al.  Bloom filter based routing for content-based publish/subscribe , 2008, DEBS.

[31]  Minglu Li,et al.  H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems , 2015, IEEE Transactions on Parallel and Distributed Systems.

[32]  Mark H. Overmars,et al.  On the Equivalence of Some Rectangle Problems , 1982, Inf. Process. Lett..

[33]  Minglu Li,et al.  REIN: A fast event matching approach for content-based publish/subscribe systems , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

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

[35]  Duc A. Tran,et al.  A random projection approach to subscription covering detection in publish/subscribe systems , 2007, 2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007).

[36]  Srinivas Aluru,et al.  Indexing for Subscription Covering in Publish-Subscribe Systems , 2005, PDCS.

[37]  Hans-Arno Jacobsen,et al.  Analysis and optimization for boolean expression indexing , 2013, TODS.

[38]  Alex Delis,et al.  Using the graphics processor unit to realize data streaming operations , 2009, MDS '09.

[39]  Kian-Lee Tan,et al.  An Efficient Publish/Subscribe Index for ECommerce Databases , 2014, Proc. VLDB Endow..