An event-oriented inference algorithm with timing constraints

Authors:
Ying Qiao;Hongan Wang;Xiang Li
Affiliations:
Institute of Software, CAS, Zhong Guan Cun Nan Si St., Beijing, China;Institute of Software, CAS, Zhong Guan Cun Nan Si St., Beijing, China;Tsinghua University, Shuang Qing St., Beijing, China
Venue:
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Year:
2012

Citing 6
Cited 0

An event detection algebra for reactive systems

Proceedings of the 4th ACM international conference on Embedded software
SnoopIB: interval-based event specification and detection for active databases

Data & Knowledge Engineering
Developing event-condition-action rules in real-time active database

Proceedings of the 2007 ACM symposium on Applied computing
Efficient pattern matching over event streams

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Recognizing patterns in streams with imprecise timestamps

Proceedings of the VLDB Endowment
High-performance nested CEP query processing over event streams

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Event streaming processing (ESP) has been well investigated in recent years. Many approaches have been proposed on this aspect. However, none of them considers the timing constraints held by high-level reactive applications. In this paper, we present an event-oriented inference algorithm with timing constraints, called RTEIA, to make automatic decisions about how to react to continuously arriving events (i.e., event streams) so that the deadlines of inference delay for rules can be met as much as possible. Simulation results show that the heuristic searching policy used by RTEIA effectively improves the number of times that rules are fired within the deadlines of their inference delay (NAFS).