Containment of UC2RPQ: the hard and easy cases - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

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.
Fichier principal
Vignette du fichier
main.pdf (1.77 Mo) Télécharger le fichier
1_Figueira.mp4 (18.57 Mo) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-02291888 , version 1 (19-09-2019)
hal-02291888 , version 2 (30-12-2019)

Identifiers

Cite

Diego Figueira. Containment of UC2RPQ: the hard and easy cases. International Conference on Database Theory (ICDT), Mar 2020, Copenhagen, Denmark. pp.9:1-9:18, ⟨10.4230/LIPIcs.ICDT.2020.9⟩. ⟨hal-02291888v2⟩

Collections

CNRS TDS-MACS ANR
342 View
129 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More