A relaxed approach to RDF querying
Hurtado, C.A. and Poulovassilis, Alex and Wood, Peter (2006) A relaxed approach to RDF querying. In: Cruz, I.F. and Decker, S. and Allemang, D. and Preist, C. and Schwabe, D. and Mika, P. and Uschold, M. and Aroyo, L. (eds.) ISWC 2006: The Semantic Web. Lecture Notes in Computer Science 4273. Springer, pp. 314-328. ISBN 9783540490296.
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 |
Depositing User: | Sarah Hall |
Date Deposited: | 18 Oct 2021 13:37 |
Last Modified: | 09 Aug 2023 12:52 |
URI: | https://eprints.bbk.ac.uk/id/eprint/46318 |
Statistics
Additional statistics are available via IRStats2.