A Relaxed Approach to RDF Querying

From semanticweb.org

A paper written by Alexandra Poulovassilis, Peter Wood and Carlos Hurtado. It was presented at the ISWC2006.

[edit] Abstract

We explore flexible querying of RDF data, with the aim of making it possible to return data satisfying query conditions with varying degrees of exactness, and also to rank the results of a query depending on how ``closely they satisfy the query conditions. We make queries more flexible by logical relaxation of their conditions based on the notion of RDF entailment, which naturally incorporates RDFS ontologies. We develop a notion of ranking of query answers, and present a query processing algorithm for incrementally computing the relaxed answer of a query. Our approach has application in scenarios where there is a lack of understanding of the ontology underlying the data, or where the data objects have heterogeneous sets of properties or irregular structures.

The schedule for this talk can be found in the conference programme and a linked list of all talks is provided in the article on ISWC2006 papers. This article has originally been created from the RDF metadata for ISWC 2006.