Ranking Approximate Answers to Semantic Web Queries
published: July 28, 2009, recorded: June 2009, views: 2892
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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 an approximate matching of the user's query to the data and can rank the answers in terms of how closely they match the original query. We show that our approximate matching framework allows us to incorporate RDFS inference rules as well as standard notions of approximation such as edit distance, thereby capturing semantic as well as syntactic approximations. The query language we adopt comprises conjunctions of regular path queries, thus including extensions proposed for SPARQL to allow for querying paths using regular expressions. We provide an incremental query evaluation algorithm which runs in polynomial time and returns answers to the user in ranked order.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !