Relative temporal constraints in the Rete algorithm for complex event detection

Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock market analysis to news services. Its purpose is the identification of event patterns with logical, temporal or causal relationships within multiple occurring events. The Rete algorithm is commonly used in rule-based systems to trigger certain actions if a corresponding rule holds. Its good performance for a high number of rules in the rulebase makes it ideally suited for complex event detection. However, the traditional Rete algorithm is limited to operations such as unification and the extraction of predicates from a knowledge base. There is no support for temporal operators. We propose an extension of the Rete algorithm to support the detection of relative temporal constraints. Further, we propose an efficient means to perform the garbage collection in the Rete algorithm in order to discard events after they c...

• Type: Conference
• Year: 2008
• Where: DEBS
• Authors: Karen Walzer, Tino Breddin, Matthias Groch
• Keywords: Complex Event, DEBS 2008, Distributed And Parallel Computing, Rete Algorithm, Temporal Constraints