Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Approximating Certain Query Answers on Nested Hyperstreams

Iovka Boneva 1 Joachim Niehren 2 Momar Sakho 2
2 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : The need to produce sequential output in complex event processing quickly leads to latency bot- tlenecks. Recently it was proposed to circumvented this problem by producing sequential output on a hyperstream rather than an ordinary stream. Hyperstreams are streams with references. In this paper, we study the problem of how to approximate the set of certain query answers on hyperstreams, to the best of our knowledge for the first time. We study nested hyperstreams, i.e., hyperstreams for nested words. As query language we consider first-order queries with regular paths that can be compiled to nested word automata.
Complete list of metadatas
Contributor : Inria Links <>
Submitted on : Sunday, April 7, 2019 - 10:23:46 PM
Last modification on : Friday, December 11, 2020 - 6:44:06 PM


  • HAL Id : hal-02092276, version 1



Iovka Boneva, Joachim Niehren, Momar Sakho. Approximating Certain Query Answers on Nested Hyperstreams. 2019. ⟨hal-02092276⟩



Record views