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:	QA75 Electronic computers Computer science
Online Access:	http://eprints.utm.my/id/eprint/77869/1/BabakBehraveshPFC2016.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.77869
record_format	uketd_dc
spelling	my-utm-ep.778692018-07-23T05:46:01Z Enhancing performance and expressibility of complex event processing using binary tree-based directed graph 2016-02 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 http://eprints.utm.my/id/eprint/77869/ http://eprints.utm.my/id/eprint/77869/1/BabakBehraveshPFC2016.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:97601 phd doctoral Universiti Teknologi Malaysia, Faculty of Computing Faculty of Computing
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
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
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
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
granting_institution	Universiti Teknologi Malaysia, Faculty of Computing
granting_department	Faculty of Computing
publishDate	2016
url	http://eprints.utm.my/id/eprint/77869/1/BabakBehraveshPFC2016.pdf
_version_	1747817850983153664

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

Similar Items