Section: New Results

Managing Dynamic Linked Data

Complex Event Processing

Complex event processing requires to answer queries on streams of complex events, i.e., nested words or equivalently linearizations of data trees, but also to produce dynamically evolving data structures as output.

In an article published in LATA [17], I. Boneva, J. Niehren and M. Sakho studied certain query answering for hyperstreams - which are collections of connected streams - with complex events (i.e. that correspond to tree patterns). They showed that the problem is EXP -complete in general, and obtained PTIME algorithms when restricted to linear tree patterns (possibly with compression) and to deterministic tree automata.