Regular path queries with constraints

Abstract

The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered. The focus is on the use of local information expressed in the form of path constraints in the optimization of the path expression queries. In particular, decidability and complexity results on the implication problem for path constraints are established.