Efficient Query Answering for OWL 2.

The QL profile of OWL 2 has been designed so that it is possible to use database technology for query answering via query rewriting. We present a comparison of our resolution based rewriting algorithm with the standard algorithm proposed by Calvanese et al., implementing both and conducting an empir...

Full description

Bibliographic Details
Main Authors: Pérez-Urbina, H, Horrocks, I, Motik, B
Other Authors: Bernstein, A
Format: Journal article
Language:English
Published: Springer 2009
_version_ 1797088418466889728
author Pérez-Urbina, H
Horrocks, I
Motik, B
author2 Bernstein, A
author_facet Bernstein, A
Pérez-Urbina, H
Horrocks, I
Motik, B
author_sort Pérez-Urbina, H
collection OXFORD
description The QL profile of OWL 2 has been designed so that it is possible to use database technology for query answering via query rewriting. We present a comparison of our resolution based rewriting algorithm with the standard algorithm proposed by Calvanese et al., implementing both and conducting an empirical evaluation using ontologies and queries derived from realistic applications. The results indicate that our algorithm produces significantly smaller rewritings in most cases, which could be important for practicality in realistic applications. © Springer-Verlag Berlin Heidelberg 2009.
first_indexed 2024-03-07T02:49:48Z
format Journal article
id oxford-uuid:ad47ee9b-b909-4b7c-a8fa-ba3d897fa8f5
institution University of Oxford
language English
last_indexed 2024-03-07T02:49:48Z
publishDate 2009
publisher Springer
record_format dspace
spelling oxford-uuid:ad47ee9b-b909-4b7c-a8fa-ba3d897fa8f52022-03-27T03:34:39ZEfficient Query Answering for OWL 2.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:ad47ee9b-b909-4b7c-a8fa-ba3d897fa8f5EnglishSymplectic Elements at OxfordSpringer2009Pérez-Urbina, HHorrocks, IMotik, BBernstein, AKarger, DRHeath, TFeigenbaum, LMaynard, DMotta, EThirunarayan, KThe QL profile of OWL 2 has been designed so that it is possible to use database technology for query answering via query rewriting. We present a comparison of our resolution based rewriting algorithm with the standard algorithm proposed by Calvanese et al., implementing both and conducting an empirical evaluation using ontologies and queries derived from realistic applications. The results indicate that our algorithm produces significantly smaller rewritings in most cases, which could be important for practicality in realistic applications. © Springer-Verlag Berlin Heidelberg 2009.
spellingShingle Pérez-Urbina, H
Horrocks, I
Motik, B
Efficient Query Answering for OWL 2.
title Efficient Query Answering for OWL 2.
title_full Efficient Query Answering for OWL 2.
title_fullStr Efficient Query Answering for OWL 2.
title_full_unstemmed Efficient Query Answering for OWL 2.
title_short Efficient Query Answering for OWL 2.
title_sort efficient query answering for owl 2
work_keys_str_mv AT perezurbinah efficientqueryansweringforowl2
AT horrocksi efficientqueryansweringforowl2
AT motikb efficientqueryansweringforowl2