GrapeL: Combining Graph Pattern Matching and Complex Event Processing
Incremental Graph Pattern Matching (IGPM) offers an elegant approach to find patterns in graph-based models, reporting newly added and recently removed pattern matches.
However, analyzing these matches w.r.t. temporal and causal dependencies can in general only be done by extending not just the IGPM engine but also the underlying model, which often is impractical and sometimes even impossible.
Therefore, we transform the stream of pattern matches to a stream of events and employ Complex Event Processing (CEP) to detect such dependencies and derive more complex events from them.
For this purpose, we introduce GrapeL as a textual language to specify and generate integrated solutions using both IGPM and CEP to benefit from the synergy of both approaches, which we present in the context of a flight and booking scenario.
Finally, we show that our solution can compete with an optimized hand-crafted version without GrapeL and CEP while offering a specification that yields a less tedious and error-prone design process.