loading...
Searching the Semantic Web: Approximate Query Processing Based on Ontologies
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MIS.2006.16January/February 2006 (vol. 21 no. 1) pp. 20-27
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In the context of the Semantic Web, many possible executing queries wouldn't retrieve any resources. This is because the viewpoints of ontology designers, annotation designers, and users performing a Web search don't always match, leading to missed answers. Approximate query processing is thus of prime importance for efficiently searching the Semantic Web. The Corese ontology-based search engine handles RDF Schema, part of and OWL Lite and RDF metadata, and can process approximate queries.

This article is part of a special issue on AI, Agents, and the Web.

Index Terms:
Semantic Web, Web search, approximate queries, RDF Schema, RDF, conceptual graphs
Citation:
Olivier Corby, Rose Dieng-Kuntz, Catherine Faron-Zucker, Fabien Gandon, "Searching the Semantic Web: Approximate Query Processing Based on Ontologies," IEEE Intelligent Systems, vol. 21, no. 1, pp. 20-27, Jan./Feb. 2006, doi:10.1109/MIS.2006.16
Usage of this product signifies your acceptance of the Terms of Use.