Efficient probabilistic event stream processing with lineage and Kleene-plus

Zhitao Shen, Hideyuki Kawashima, Hiroyuki Kitagawa

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)355-374
Number of pages20
JournalInternational Journal of Communication Networks and Distributed Systems
Volume2
Issue number4
DOIs
Publication statusPublished - 2009 Dec 1
Externally publishedYes

Fingerprint

Query languages
Finite automata
Processing
Data structures
Composite materials
Experiments

Keywords

  • Data stream
  • Event stream processing
  • Kleene-plus
  • Lineage
  • Nondeterministic finite automata
  • Probabilistic data management

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Efficient probabilistic event stream processing with lineage and Kleene-plus. / Shen, Zhitao; Kawashima, Hideyuki; Kitagawa, Hiroyuki.

In: International Journal of Communication Networks and Distributed Systems, Vol. 2, No. 4, 01.12.2009, p. 355-374.

Research output: Contribution to journalArticle

@article{848674dda7f748edaeea4e8d357d22ef,
title = "Efficient probabilistic event stream processing with lineage and Kleene-plus",
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.",
keywords = "Data stream, Event stream processing, Kleene-plus, Lineage, Nondeterministic finite automata, Probabilistic data management",
author = "Zhitao Shen and Hideyuki Kawashima and Hiroyuki Kitagawa",
year = "2009",
month = "12",
day = "1",
doi = "10.1504/IJCNDS.2009.026554",
language = "English",
volume = "2",
pages = "355--374",
journal = "International Journal of Communication Networks and Distributed Systems",
issn = "1754-3916",
publisher = "Inderscience Publishers",
number = "4",

}

TY - JOUR

T1 - Efficient probabilistic event stream processing with lineage and Kleene-plus

AU - Shen, Zhitao

AU - Kawashima, Hideyuki

AU - Kitagawa, Hiroyuki

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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.

AB - 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.

KW - Data stream

KW - Event stream processing

KW - Kleene-plus

KW - Lineage

KW - Nondeterministic finite automata

KW - Probabilistic data management

UR - http://www.scopus.com/inward/record.url?scp=77956299079&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956299079&partnerID=8YFLogxK

U2 - 10.1504/IJCNDS.2009.026554

DO - 10.1504/IJCNDS.2009.026554

M3 - Article

AN - SCOPUS:77956299079

VL - 2

SP - 355

EP - 374

JO - International Journal of Communication Networks and Distributed Systems

JF - International Journal of Communication Networks and Distributed Systems

SN - 1754-3916

IS - 4

ER -