The Community for Technology Leaders
Green Image
Issue No. 11 - Nov. (2014 vol. 26)
ISSN: 1041-4347
pp: 2759-2773
Matthias Weidlich , Department of Computing, Imperial College London, Office 346, Huxley Building, 180 Queen's Gate London, United Kingdom
Holger Ziekow , AGT International, , Germany
Avigdor Gal , Faculty of Industrial Engineering & Management, Technion–Israel Institute of Technology, Technion City, 32000 Haifa, Israel
Jan Mendling , Department of Information Systems & Operations, Institute for Information Business, Wirtschaftsuniversität Wien, Welthandelsplatz 1, A-1020 Vienna, Austria
Mathias Weske , Hasso Plattner Institute for IT-Systems Engineering, University of Potsdam, Prof.-Dr.-Helmert-Str. 2-3, D-14482 Potsdam, Germany
A growing number of enterprises use complex event processing for monitoring and controlling their operations, while business process models are used to document working procedures. In this work, we propose a comprehensive method for complex event processing optimization using business process models. Our proposed method is based on the extraction of behaviorial constraints that are used, in turn, to rewrite patterns for event detection, and select and transform execution plans. We offer a set of rewriting rules that is shown to be complete with respect to the $all$ , $seq$, and $any$ patterns. The effectiveness of our method is demonstrated in an experimental evaluation with a large number of processes from an insurance company. We illustrate that the proposed optimization leads to significant savings in query processing. By integrating the optimization in state-of-the-art systems for event pattern matching, we demonstrate that these savings materialize in different technical infrastructures and can be combined with existing optimization techniques.
Business, Optimization, Pattern matching, Semantics, Context, Compounds, Engines

M. Weidlich, H. Ziekow, A. Gal, J. Mendling and M. Weske, "Optimizing Event Pattern Matching Using Business Process Models," in IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. 11, pp. 2759-2773, 2014.
611 ms
(Ver 3.3 (11022016))