146 search results - page 6 / 30 » Rewriting of Regular Expressions and Regular Path Queries |
IDEAS
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
PODS
2004
ACM
15 years 9 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
PODS
2000
ACM
15 years 1 months ago
2000
ACM
PODS
1998
ACM
15 years 1 months ago
1998
ACM
