Show simple item record

dc.contributor.authorLiu, M.
dc.contributor.authorRundensteiner, E.
dc.contributor.authorDougherty, D.
dc.contributor.authorGupta, C.
dc.contributor.authorWang, S.
dc.contributor.authorArı, İsmail
dc.contributor.authorMehta, A.
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractComplex event processing (CEP) over event streams has become increasingly important for real-time applications ranging from health care, supply chain management to business intelligence. These monitoring applications submit complex queries to track sequences of events that match a given pattern. As these systems mature the need for increasingly complex nested sequence query support arises, while the state-of-art CEP systems mostly support the execution of flat sequence queries only. To assure real-time responsiveness and scalability for pattern detection even on huge volume high-speed streams, efficient processing techniques must be designed. In this paper, we first analyze the prevailing nested pattern query processing strategy and identify several serious shortcomings. Not only are substantial subsequences first constructed just to be subsequently discarded, but also opportunities for shared execution of nested subexpressions are overlooked. As foundation, we introduce NEEL, a CEP query language for expressing nested CEP pattern queries composed of sequence, negation, AND and OR operators. To overcome deficiencies, we design rewriting rules for pushing negation into inner subexpressions. Next, we devise a normalization procedure that employs these rules for flattening a nested complex event expression. To conserve CPU and memory consumption, we propose several strategies for efficient shared processing of groups of normalized NEEL subexpressions. These strategies include prefix caching, suffix clustering and customized “bit-marking” execution strategies. We design an optimizer to partition the set of all CEP subexpressions in a NEEL normal form into groups, each of which can then be mapped to one of our shared execution operators. Lastly, we evaluate our technologies by conducting a performance study to assess the CPU processing time using real-world stock trades data. Our results confirm that our NEEL execution in many cases performs 100 fold fast er than the traditional iterative nested execution strategy for real stock market query workloads.
dc.description.sponsorshipHP Labs Innovation Research Program ; NSF ; TÜBİTAK
dc.relation.ispartof2011 IEEE 27th International Conference on Data Engineering
dc.titleHigh-performance nested CEP query processing over event streamsen_US
dc.typeConference paperen_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID(ORCID 0000-0002-6159-0484 & YÖK ID 43541) Arı, İsmail
dc.contributor.ozuauthorArı, İsmail
dc.subject.keywordsQuery languages
dc.subject.keywordsQuery processing
dc.relation.publicationcategoryConference Paper - International - Institutional Academic Staff

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Share this page