Hurtado, C.A. and Poulovassilis, Alexandra and Wood, Peter T. (2009) Ranking approximate answers to semantic web queries. In: Aroyo, L. and Traverso, P. and Ciravegna, F. and Cimiano, P. and Heath, T. and Hyvonen, E. and Mizoguchi, R. and Oren, E. and Sabou, M. and Simperl, E. (eds.) The Semantic Web: Research and Applications. Lecture Notes In Computer Science 5554. Berlin, Germany: Springer, pp. 263-277. ISBN 9783642021206.
Abstract
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. Our approximate matching framework allows us to incorporate standard notions of approximation such as edit distance as well as certain RDFS inference rules, 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.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | 6th European Semantic Web Conference, ESWC 2009 Heraklion, Crete, Greece, May 31–June 4, 2009 Proceedings |
| 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: | 11 Jun 2013 13:49 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7452 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
