Poulovassilis, Alexandra and Wood, Peter T. (2010) Combining approximation and relaxation in semantic web path queries. In: Patel-Schneider, P.F. and Pan, Y. and Hitzler, P. and Mika, P. and Zhang, L. and Pan, J.Z. and Horrocks, I. and Glimm, B. (eds.) The Semantic Web – ISWC 2010. Lecture Notes In Computer Science 6496. Berlin, Germany: Springer, pp. 631-646. ISBN 9783642177453.
Abstract
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks knowledge of its full structure or where the structure is irregular. In such circumstances, it is helpful if the querying system can perform both approximate matching and relaxation of the user’s query and can rank the answers according to how closely they match the original query. Our framework incorporates both standard notions of approximation based on edit distance and RDFS-based inference rules. 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.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | 9th International Semantic Web Conference, ISWC 2010, Shanghai, China, November 7-11, 2010, Revised Selected Papers, Part I |
| 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: | 13 Jun 2013 08:44 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7460 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
