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

Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams (long version)

Iovka Boneva 1 Joachim Niehren 2 Momar Sakho 2
2 LINKS - Linking Dynamic Data
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189, Inria Lille - Nord Europe
Abstract : We study the problem of certain query answering (CQA) on compressed string patterns. These are incomplete singleton context-free grammars, that can model systems of multiple streams with references to others, called hyperstreams more recently. In order to capture regular path queries on strings, we consider nondeterministic finite automata (NFAs) for query definition. It turns out that CQA for Boolean NFA queries is equivalent to regular string pattern inclusion, i.e., whether all strings completing a compressed string pattern belong to a regular language. We prove that CQA on compressed string patterns is PSPACE-complete for NFA queries. The PSPACE-hardness even applies to Boolean queries defined by deterministic finite automata (DFAs) and without compression. We also show that CQA on compressed linear string patterns can be solved in PTIME for DFA queries.
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Inria Links Connect in order to contact the contributor
Submitted on : Friday, July 20, 2018 - 5:12:57 PM
Last modification on : Tuesday, January 4, 2022 - 5:32:16 AM
Long-term archiving on: : Sunday, October 21, 2018 - 9:01:32 PM


Files produced by the author(s)


  • HAL Id : hal-01846016, version 1



Iovka Boneva, Joachim Niehren, Momar Sakho. Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams (long version). 2018. ⟨hal-01846016⟩



Les métriques sont temporairement indisponibles