Reaching New Limits: Discovery of Multi-Dimensional Disjunctive Subsequence-Queries with Intervals

Abstract

A query model for sequence data was introduced in Kleest-Meißner et al. (2022) in the form of subsequence-queries with wildcards and gap-size constraints (swg-queries, for short). These queries consist of a pattern over an alphabet of variables and values, as well as a global window size and a number of local gap-size constraints.

Based on previous extensions of swg-queries, namely multi-dimensional swg-queries and disjunctive swg-queries, we converge to common languages in the field of Complex Event Processing by introducing multi-dimensional disjunctive subsequence-queries with intervals. This pushes the expressive power of the query language to certain kinds of inequalities as well. We discuss a suitable characterisation of containment of multi-dimensional disjunctive subsequence queries with intervals, and adapt results concerning the discovery of (multi-dimensional or disjunctive) swg-queries to multi-dimensional disjunctive subsequence-queries with intervals.