Containment of UC2RPQ: the hard and easy cases
D Figueira - 23rd International Conference on Database Theory …, 2020 - drops.dagstuhl.de
23rd International Conference on Database Theory (ICDT 2020), 2020•drops.dagstuhl.de
We study the containment problem for UC2RPQ, that is, two-way Regular Path Queries,
closed under conjunction, projection and union. We show a dichotomy property between
PSpace-c and ExpSpace-c based on a property on the underlying graph of queries. We
show that for any class C of graphs, the containment problem for queries whose underlying
graph is in C is in PSpace if and only if C has bounded bridgewidth. Bridgewidth is a graph
measure we introduce to this end, defined as the maximum size of a minimal edge separator …
closed under conjunction, projection and union. We show a dichotomy property between
PSpace-c and ExpSpace-c based on a property on the underlying graph of queries. We
show that for any class C of graphs, the containment problem for queries whose underlying
graph is in C is in PSpace if and only if C has bounded bridgewidth. Bridgewidth is a graph
measure we introduce to this end, defined as the maximum size of a minimal edge separator …
Abstract
We study the containment problem for UC2RPQ, that is, two-way Regular Path Queries, closed under conjunction, projection and union. We show a dichotomy property between PSpace-c and ExpSpace-c based on a property on the underlying graph of queries. We show that for any class C of graphs, the containment problem for queries whose underlying graph is in C is in PSpace if and only if C has bounded bridgewidth. Bridgewidth is a graph measure we introduce to this end, defined as the maximum size of a minimal edge separator of a graph.
drops.dagstuhl.de
Showing the best result for this search. See all results