Enhancing performance and expressibility of complex event processing using binary tree-based directed graph

In various domains, applications are required to detect and react to complex situations accordingly. In response to the demand for matching receiving events to complex patterns, several event processing systems have been developed. However, there are just a few of them considered both performance an...

Full description

Saved in:
Bibliographic Details
Main Author: Behravesh, Babak
Format: Thesis
Language:English
Published: 2016
Subjects:
Online Access:http://eprints.utm.my/id/eprint/77869/1/BabakBehraveshPFC2016.pdf
http://eprints.utm.my/id/eprint/77869/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:97601
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.77869
record_format eprints
spelling my.utm.778692018-07-23T05:46:01Z http://eprints.utm.my/id/eprint/77869/ Enhancing performance and expressibility of complex event processing using binary tree-based directed graph Behravesh, Babak QA75 Electronic computers. Computer science In various domains, applications are required to detect and react to complex situations accordingly. In response to the demand for matching receiving events to complex patterns, several event processing systems have been developed. However, there are just a few of them considered both performance and expressibility of event matching as focusing only on performance can cause negative effect on the expressibility or vice versa. This research develops a fast adaptive event matching system (FAEM), a new event matching system to improve expressibility and performance measures (throughput and end-to-end latency). This system is designed and developed based on a novel binary tree-based directed graph (BTDG) as a unified basis for event-matching. The proposed system transforms a user-defined query into a set of system objects including buffers, conditions on buffers, cursors, and join operators (non-kleene and kleene operators) and arranges these objects on a BTDG. Provided BTDG the enhancement in performance of non-kleene operators applied through developing a batch removal method to remove the events that are located out of time-window, and an actual time window (ATW) which can improve performance of event matching. To improve performance of kleene operators, this research introduces a twin algorithms for kleene operator which is match to BTDG. These two kleene algorithms apply grouping on events and reduce the number of intermediate results and apply combination algorithm in final stage. Transformation of queries containing join operators into BTDG enhances the expressibility of the proposed CEP system. 2016-02 Thesis NonPeerReviewed application/pdf en http://eprints.utm.my/id/eprint/77869/1/BabakBehraveshPFC2016.pdf Behravesh, Babak (2016) Enhancing performance and expressibility of complex event processing using binary tree-based directed graph. PhD thesis, Universiti Teknologi Malaysia, Faculty of Computing. http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:97601
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Behravesh, Babak
Enhancing performance and expressibility of complex event processing using binary tree-based directed graph
description In various domains, applications are required to detect and react to complex situations accordingly. In response to the demand for matching receiving events to complex patterns, several event processing systems have been developed. However, there are just a few of them considered both performance and expressibility of event matching as focusing only on performance can cause negative effect on the expressibility or vice versa. This research develops a fast adaptive event matching system (FAEM), a new event matching system to improve expressibility and performance measures (throughput and end-to-end latency). This system is designed and developed based on a novel binary tree-based directed graph (BTDG) as a unified basis for event-matching. The proposed system transforms a user-defined query into a set of system objects including buffers, conditions on buffers, cursors, and join operators (non-kleene and kleene operators) and arranges these objects on a BTDG. Provided BTDG the enhancement in performance of non-kleene operators applied through developing a batch removal method to remove the events that are located out of time-window, and an actual time window (ATW) which can improve performance of event matching. To improve performance of kleene operators, this research introduces a twin algorithms for kleene operator which is match to BTDG. These two kleene algorithms apply grouping on events and reduce the number of intermediate results and apply combination algorithm in final stage. Transformation of queries containing join operators into BTDG enhances the expressibility of the proposed CEP system.
format Thesis
author Behravesh, Babak
author_facet Behravesh, Babak
author_sort Behravesh, Babak
title Enhancing performance and expressibility of complex event processing using binary tree-based directed graph
title_short Enhancing performance and expressibility of complex event processing using binary tree-based directed graph
title_full Enhancing performance and expressibility of complex event processing using binary tree-based directed graph
title_fullStr Enhancing performance and expressibility of complex event processing using binary tree-based directed graph
title_full_unstemmed Enhancing performance and expressibility of complex event processing using binary tree-based directed graph
title_sort enhancing performance and expressibility of complex event processing using binary tree-based directed graph
publishDate 2016
url http://eprints.utm.my/id/eprint/77869/1/BabakBehraveshPFC2016.pdf
http://eprints.utm.my/id/eprint/77869/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:97601
_version_ 1643657658458177536
score 13.160551