23 search results - page 4 / 5 » Containment of Conjunctive Regular Path Queries with Inverse |
103
click to vote
SEMWEB
2010
Springer
14 years 9 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...
110
click to vote
FQAS
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
FOIKS
2010
Springer
15 years 6 months ago
2010
Springer
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
108
click to vote
ESWS
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
91
Voted
WIDM
2003
ACM
15 years 4 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...