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
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
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 metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01846016
Contributor : Inria Links <>
Submitted on : Friday, July 20, 2018 - 5:12:57 PM
Last modification on : Friday, April 19, 2019 - 4:55:17 PM
Document(s) archivé(s) le : Sunday, October 21, 2018 - 9:01:32 PM

File

0-long.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01846016, version 1

Collections

Citation

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

Share

Metrics

Record views

176

Files downloads

251