53 search results - page 2 / 11 » Preferential Regular Path Queries |
IDEAS
2007
IEEE
14 years 2 days 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...
FOIKS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
PODS
2003
ACM
14 years 5 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
PODS
2000
ACM
13 years 10 months ago
2000
ACM
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...