An Event Composite Matching Approach Based on the OBDD Graphs

One crucial issue of content-based Pub/Sub systems is the content-based event matching. The existing approaches that utilize simple constraints to match the contents of events are not enough. For example, in the enterprise application integration scenarios, the event matching is often “many-to-one” matching or “one-to-many” matching. Therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, three matching models are proposed, the simple matching is extended to the multi-semantic matching, and the temporal constraint variable is introduced. The operations differ in accordance with the different semantics; the discrete events are supported by the temporal constraint variable. Then, OBDD graphs are extended into hierarchy colored OBDD graphs and the equality of the transformation is further proved. Based on the extended OBDD graphs, the composite matching algorithms are presented and analyzed. Experiments show that the proposed algorithms are effectual.