Sciweavers

SEMWEB
2010
Springer
13 years 10 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
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...
Alexandra Poulovassilis, Peter T. Wood
FUIN
2008
88views more  FUIN 2008»
14 years 14 days ago
Preferential Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
Gösta Grahne, Alex Thomo, William W. Wadge
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
14 years 2 months ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...
DBPL
2001
Springer
115views Database» more  DBPL 2001»
14 years 5 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
14 years 6 months ago
Boundedness of Regular Path Queries in Data Integration Systems
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...
Gösta Grahne, Alex Thomo