Plan Based Parallel Complex Event Detection over RFID Streams

Wang, Yongheng; Cai, Jianyu; Yang, Shenghong

doi:10.1109/icise.2009.833

Cited by 3 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Problems such as the above are common in complex event processing applications [1,4,5,6,7,8,19,23,24,26,27,29,31,32,33,34,35,37] where the goal is to efficiently detect occurrences of complex events which are usually represented as patterns of events sharing some temporal relationship with each other. Examples of complex events include state changes in business and industrial processes, problems in enterprise systems and state changes in the environment.…”

Section: Motivationmentioning

confidence: 99%

Constraint Satisfaction over Generalized Staircase Constraints

Mitra,

Dutta,

Bhattacharya

2013

Preprint

View full text Add to dashboard Cite

One of the key research interests in the area of Constraint Satisfaction Problem (CSP) is to identify tractable classes of constraints and develop efficient solutions for them. In this paper, we introduce generalized staircase (GS) constraints which is an important generalization of one such tractable class found in the literature, namely, staircase constraints. GS constraints are of two kinds, down staircase (DS) and up staircase (US). We first examine several properties of GS constraints, and then show that arc consistency is sufficient to determine a solution to a CSP over DS constraints. Further, we propose an optimal O(cd) time and space algorithm to compute arc consistency for GS constraints where c is the number of constraints and d is the size of the largest domain. Next, observing that arc consistency is not necessary for solving a DSCSP, we propose a more efficient algorithm for solving it. With regard to US constraints, arc consistency is not known to be sufficient to determine a solution, and therefore, methods such as path consistency or variable elimination are required. Since arc consistency acts as a subroutine for these existing methods, replacing it by our optimal O(cd) arc consistency algorithm produces a more efficient method for solving a USCSP.

show abstract

Section: Motivationmentioning

confidence: 99%

Constraint Satisfaction over Generalized Staircase Constraints

Mitra,

Dutta,

Bhattacharya

2013

Preprint

View full text Add to dashboard Cite

show abstract

Complex Event Processing over distributed probabilistic event streams

Wang

Zhang

2012

2012 9th International Conference on Fuzzy Systems and Knowledge Discovery

Self Cite

View full text Add to dashboard Cite

In the 21st century, as technologies of perceptual recognition develops, devices of information generation begin to accurately sense, measure and monitor the physical world in real time.Complex Event Processing(CEP), which can be used to extract user level information from raw data, becomes the key part of the IoT middleware. Most of the current study of complex event processing has not focus on distributed uncertain event streams. In this paper, a high performance method over distributed uncertain event streams is proposed. This method uses improved matched tree that include node buffer list and probability calculation to detect complex event in single uncertain event stream. Distributed stream processing platform Storm also is brought in to improve the performance and stability. Based on Storm, two level parallel methods are proposed to increase the throughput. The experiment study shows that this method is efficient to process complex events over distributed uncertain event streams.

show abstract