A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL

  • Authors:

  • Jianfeng Du;Guilin Qi;Jeff Z. Pan;Yi-Dong Shen

  • Affiliations:

  • Institute of Business Intelligence & Knowledge Discovery, Guangdong University of Foreign Studies, Guangzhou, China 510006 and State Key Laboratory of Computer Science, Institute of Software, Chin ...;AIFB, Universität Karlsruhe, Karlsruhe, Germany D-76128 and School of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computing Science, The University of Aberdeen, Aberdeen, UK AB24 3UE;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China 100190

  • Venue:
  • ISWC '09 Proceedings of the 8th International Semantic Web Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we propose a decomposition-based approach to optimizing existing OWL DL reasoners in evaluating conjunctive queries in OWL DL ontologies. The main idea is to decompose a given OWL DL ontology into a set of target ontologies without duplicated ABox axioms so that the evaluation of a given conjunctive query can be separately performed in every target ontology by applying existing OWL DL reasoners. This approach guarantees sound and complete results for the category of conjunctive queries that the applied OWL DL reasoner correctly evaluates. Experimental results on large benchmark ontologies and benchmark queries show that the proposed approach can significantly improve scalability and efficiency in evaluating general conjunctive queries.