Containment of UC2RPQ: the hard and easy cases

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02291888
Contributor : Diego Figueira <>
Submitted on : Monday, December 30, 2019 - 1:35:53 PM
Last modification on : Monday, January 13, 2020 - 1:11:47 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02291888, version 2

Collections

Citation

Diego Figueira. Containment of UC2RPQ: the hard and easy cases. International Conference on Database Theory (ICDT), Mar 2020, Copenhagen, Denmark. ⟨hal-02291888v2⟩

Share

Metrics

Record views

31

Files downloads

24