44 search results - page 3 / 9 » Algebraic Rewritings for Optimizing Regular Path Queries |
ICDE
2006
IEEE
14 years 7 months ago
2006
IEEE
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
IDEAS
2007
IEEE
13 years 12 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...
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...
ICDT
2010
ACM
14 years 3 months ago
2010
ACM
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...