Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams (long version) - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

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

(1) , (2) , (2)
1
2
Joachim Niehren
Momar Sakho
  • Function : Author
  • PersonId : 1019942

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.
Fichier principal
Vignette du fichier
0-long.pdf (390.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01846016 , version 1 (20-07-2018)

Identifiers

  • HAL Id : hal-01846016 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More