Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Efficient filtering in publish-subscribe systems using binary decision diagrams
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Integrating Your E-Business Enterprise
Integrating Your E-Business Enterprise
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An ontology-based publish/subscribe system
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
An efficient information dissemination for publish/subscription system on grid
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Hi-index | 0.01 |
Content-based publish/subscribe offers a convenient abstraction for information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Unlike in the traditional address-based unicast or multicast, its core problem is how to match events by predicates on the content of events. In existing matching approaches, matching predicates are composed by the conjunction and disjunction of nonsemantic constraints. But, in context of enterprise application integration, although they can match events by their contents, this traditional matching predicates are not expressive enough in manipulating the complex event matching, such as the "one-tomany" and "many-to-one" matching. Therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, we propose three matching models, extend this simple matching approach to the multisemantic matching approach and further introduce the temporal constraint variable. The multi-semantic matching approach allows using different operations in accordance with different semantics; the temporal constraint variable supports processing several discrete events in temporal sequences. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. Based on the extended OBDD graphs, the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.