Containment of Regular Path Queries Under Path Constraints

Data integrity is ensured by expressing constraints it should satisfy. One can also view constraints as data properties and take advantage of them for several tasks such as reasoning about data or accelerating query processing. In the context of graph databases, simple constraints can be expressed by means of path constraints while simple queries are modeled as regular path queries (RPQs). In this paper, we investigate the containment of RPQs under path constraints. We focus on word constraints that can be viewed as tuple-generating dependencies (TGDs) of the form for all x(1), x(2),there exists (z) over bar, a(1)(x(1), y(1)) boolean AND.....boolean AND a(i) (y(i-1), y(i)) boolean AND.... boolean AND a(n)( y(n-1), x(2)) -> there exists(z) over bar, b(1)(x(1), z(1))boolean AND.....boolean AND b(i) ( z(i-1), z(i))boolean AND....boolean AND b(m)(z(m-1), x(2)). Such a constraint means that whenever two nodes in a graph are connected by a path labeled a(1)... a(n), there is also a path labeled b(1)... b(m) that connects them. Rewrite systems offer an abstract view of these TGDs: the rewrite rule a(1)... a(n) -> b(1)... b(m) represents the previous constraint. A set of constraints C is then represented by a rewrite system R and, when dealing with possibly infinite databases, a path query p is contained in a path query q under the constraints C iff p rewrites to q with R. Contrary to what has been claimed in the literature we show that, when restricting to finite databases only, there are cases where a path query p is contained in a path query q under the constraints C while p does not rewrite to q with R. More generally, we study the finite controllability of the containment of RPQs under word constraints, that is when this containment problem on unrestricted databases does coincide with the finite case. We give an exact characterisation of the cases where this equivalence holds. We then deduce the undecidability of the containment problem in the finite case even when RPQs are restricted to word queries. We prove several properties related to finite controllability, and in particular that it is undecidable. We also exhibit some classes of word constraints that ensure the finite controllability and the decidability of the containment problem.