Sciweavers

9 search results - page 1 / 2
» Combining Approximation and Relaxation in Semantic Web Path ...
Sort
View
SEMWEB
2010
Springer
13 years 2 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
FQAS
2006
Springer
136views Database» more  FQAS 2006»
13 years 8 months ago
Robust Query Processing for Personalized Information Access on the Semantic Web
Abstract. Research in Cooperative Query answering is triggered by the observation that users are often not able to correctly formulate queries to databases that return the intended...
Peter Dolog, Heiner Stuckenschmidt, Holger Wache
ESWS
2009
Springer
13 years 11 months ago
Ranking Approximate Answers to Semantic Web Queries
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...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ESWS
2011
Springer
12 years 8 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
PODS
2010
ACM
213views Database» more  PODS 2010»
13 years 10 months ago
Expressive languages for path queries over graph-structured data
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.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...