Efficient probabilistic event stream processing with lineage and Kleene-plus Online publication date: Fri, 19-Jun-2009
by Zhitao Shen, Hideyuki Kawashima, Hiroyuki Kitagawa
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 2, No. 4, 2009
Abstract: This paper proposes a working framework and a query language to support probabilistic queries for composite event detection over probabilistic event streams. The language allows users to express Kleene closure patterns for complex event detection in the physical world. Our processing method first detects sequence patterns over probabilistic data streams using AIG, a new data structure, which handles active states with a nondeterministic finite automaton (NFA). Our method then computes the probability of each detected sequence pattern based on its lineage. Through the benefit of lineage, the probability of an output event can be directly calculated without taking into account the query plan. An optimised plan can be selected. Finally, we conducted a performance evaluation of our method and compared the results with the original and optimised query plan. The experiment clearly showed that our proposal outperforms straight-forward query plans.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com