Query relaxation in RDF

Hurtado, C.A. and Poulovassilis, Alexandra and Wood, Peter T. (2008) Query relaxation in RDF. In: Spaccapietra, Spaccapietra (ed.) Journal on Data Semantics X. Lecture Notes in Computer Science 4900 4900. Berlin, Germany: Springer, pp. 31-61. ISBN 9783540776871.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/978-3-540-77688-8

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 RDFS entailment and 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.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Research Centres and Institutes:	Innovation Management Research, Birkbeck Centre for, Bioinformatics, Bloomsbury Centre for (Closed), Birkbeck Knowledge Lab
Depositing User:	Administrator
Date Deposited:	01 Feb 2011 12:25
Last Modified:	09 Aug 2023 12:30
URI:	https://eprints.bbk.ac.uk/id/eprint/1904

Statistics

Archive Staff Only (login required)

Edit/View Item