Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...