Sciweavers

Share
390 search results - page 1 / 78
» Ranking Approximate Answers to Semantic Web Queries
Sort
View
ESWS
2009
Springer
8 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 ...
SEMWEB
2010
Springer
8 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
2009
Springer
127views Database» more  FQAS 2009»
8 years 11 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of ļ¬nding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
WWW
2009
ACM
9 years 5 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
9 years 6 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
books