Abstract
Complex event processing is an important technology with possible application in supply chain management and business activity monitoring. Its basis is the identification of event patterns within multiple occurring events having logical, causal or temporal relationships.
The Rete algorithm is commonly used in rule-based systems to trigger certain actions if a corresponding rule holds. The algorithm’s good performance for a high number of rules makes it ideally suited for complex event detection. However, the traditional Rete algorithm does not support aggregation of values in time-based windows although this is a common requirement in complex event processing for business applications.
We propose an extension of the Rete algorithm to support temporal reasoning, namely the detection of time-based windows by adding a time-enabled beta-node to restrict event detection to a certain time-frame.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Demers, A.J., Gehrke, J., Panda, B., Riedewald, M., Sharma, V., White, W.M.: Cayuga: A general purpose event monitoring system. In: CIDR, pp. 412–422 (2007)
Li, G., Jacobsen, H.A.: Composite subscriptions in content-based publish/subscribe systems. In: Middleware, pp. 249–269 (2005)
Forgy, C.: Rete: A fast algorithm for the many patterns/many objects match problem. Artif. Intell. 19(1), 17–37 (1982)
Berstel, B.: Extending the RETE Algorithm for Event Management. In: TIME 2002: Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME 2002), Washington, DC, USA, vol. 49. IEEE Computer Society, Los Alamitos (2002)
Walzer, K., Breddin, T., Groch, M.: Relative Temporal Constraints in the Rete Algorithm for Complex Event Detection. In: DEBS 2008: 2nd International Conference on Distributed Event-Based Systems (to appear, 2008)
Gordin, D.N., Pasik, A.J.: Set-oriented constructs: from Rete rule bases to database systems. In: SIGMOD 1991: Proceedings of the 1991 ACM SIGMOD international conference on Management of data, pp. 60–67. ACM Press, New York (1991)
Maloof, M.A., Kochut, K.: Modifying Rete to Reason Temporally. In: ICTAI, pp. 472–473 (1993)
Teodosiu, D., Pollak, G.: Discarding unused temporal information in a production system. In: Proc.of the ISMM International Conference on Information and Knowledge Management CIKM 1992, Baltimore, MD, pp. 177–184 (1992)
Bohlen, M.H., Busatto, R., Jensen, C.S.: Point-versus interval-based temporal data models. In: ICDE, pp. 192–200 (1998)
Yoneki, E., Bacon, J.: Unified semantics for event correlation over time and space in hybrid network environments. In: Meersman, R., Tari, Z. (eds.) OTM 2005. LNCS, vol. 3760, pp. 366–384. Springer, Heidelberg (2005)
Bry, F., Eckert, M.: Temporal order optimizations of incremental joins for composite event detection. In: Proceedings of Inaugural Int. Conference on Distributed Event-Based Systems, Toronto, Canada, June 20–22, 2007. ACM, New York (2007)
Galton, A., Augusto, J.: Two approaches to event definition. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, pp. 547–556. Springer, Heidelberg (2002)
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26, 832–843 (1983)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)
White, W.M., Riedewald, M., Gehrke, J., Demers, A.J.: What is ”next” in event processing? In: PODS, pp. 263–272. ACM, New York (2007)
Srivastava, U., Widom, J.: Flexible time management in data stream systems. In: PODS 2004: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 263–274. ACM Press, New York (2004)
Arasu, A., Babu, S., Widom, J.: The CQL continuous query language: semantic foundations and query execution. The VLDB Journal 15(2), 121–142 (2006)
Ghanem, T.M., Aref, W.G., Elmagarmid, A.K.: Exploiting predicate-window semantics over data streams. SIGMOD Rec. 35(1), 3–8 (2006)
Ghanem, T.M., Hammad, M.A., Mokbel, M.F., Aref, W.G., Elmagarmid, A.K.: Incremental evaluation of sliding-window queries over data streams. IEEE Trans. Knowl. Data Eng. 19(1), 57–72 (2007)
JBoss: JBoss Rules (2007), http://labs.jboss.com/drools/
Red Hat, Inc.: Drools development branch for temporal reasoning, http://anonsvn.labs.jboss.com/labs/jbossrules/branches/temporal_rete/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walzer, K., Groch, M., Breddin, T. (2008). Time to the Rescue - Supporting Temporal Reasoning in the Rete Algorithm for Complex Event Processing. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2008. Lecture Notes in Computer Science, vol 5181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85654-2_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-85654-2_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85653-5
Online ISBN: 978-3-540-85654-2
eBook Packages: Computer ScienceComputer Science (R0)