Efficient probabilistic event stream processing with lineage and Kleene-plus. (22nd June 2009)

• Record Type: Journal Article
• Authors: Shen, Zhitao; Kawashima, Hideyuki; Kitagawa, Hiroyuki
• Is Part Of: International journal of communication networks and distributed systems. Volume 2:Number 4(2009)
• Page Start: 355
• Page End: 374
• Publication Date: 2009-06-22
• Subjects: event stream processing -- probabilistic data management -- data streams -- nondeterministic finite automata -- lineage -- Kleene-plus -- probabilistic queries -- composite event detection -- probabilistic event streams -- Kleene closure patterns -- sequence patterns; Computer networks -- Periodicals; Telecommunication systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; 004.6
• Languages: English
• ISSNs: 1754-3916

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.