The evaluation of path expression queries on semistructured data in a distr
ibuted asynchronous environment is considered. The focus is on the use of l
ocal information expressed in the form of path constraints in the optimizat
ion of path expression queries. In particular, decidability and complexity
results on the implication problem for path constraints are established. (C
) 1999 Academic Press.