146 search results - page 4 / 30 » Rewriting of Regular Expressions and Regular Path Queries |
198
click to vote
PODS
2010
ACM
15 years 10 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
149
Voted
VLDB
1990
ACM
15 years 9 months ago
1990
ACM
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
189
Voted
ISPA
2007
Springer
15 years 11 months ago
2007
Springer
Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, ther...
166
click to vote
SEMWEB
2010
Springer
15 years 3 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
297
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...