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

Jianfeng Du*, Guilin Qi, Jeff Z. Pan, Yi Dong Shen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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 OWLDL 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.

Original languageEnglish
Title of host publicationThe Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings
EditorsAbraham Bernstein, David R. Karger, Tom Heath, Lee Feigenbaum, Diana Maynard, Enrico Motta, Krishnaprasad Thirunarayan
PublisherSpringer Verlag
Pages146-162
Number of pages17
ISBN (Print)364204929X, 9783642049293
DOIs
Publication statusPublished - 1 Dec 2009
Event8th International Semantic Web Conference, ISWC 2009 - Chantilly, VA, United States
Duration: 25 Oct 200929 Oct 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5823 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Semantic Web Conference, ISWC 2009
CountryUnited States
CityChantilly, VA
Period25/10/0929/10/09

Fingerprint

Description Logics
Ontology
Query
Decomposition
Decompose
Scalability
Benchmark
Target
Axioms
Semantics
Acoustic waves
Evaluate
Evaluation
Experimental Results

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Du, J., Qi, G., Pan, J. Z., & Shen, Y. D. (2009). A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL. In A. Bernstein, D. R. Karger, T. Heath, L. Feigenbaum, D. Maynard, E. Motta, & K. Thirunarayan (Eds.), The Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings (pp. 146-162). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5823 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-04930-9_10

A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL. / Du, Jianfeng; Qi, Guilin; Pan, Jeff Z.; Shen, Yi Dong.

The Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings. ed. / Abraham Bernstein; David R. Karger; Tom Heath; Lee Feigenbaum; Diana Maynard; Enrico Motta; Krishnaprasad Thirunarayan. Springer Verlag, 2009. p. 146-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5823 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Du, J, Qi, G, Pan, JZ & Shen, YD 2009, A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL. in A Bernstein, DR Karger, T Heath, L Feigenbaum, D Maynard, E Motta & K Thirunarayan (eds), The Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5823 LNCS, Springer Verlag, pp. 146-162, 8th International Semantic Web Conference, ISWC 2009, Chantilly, VA, United States, 25/10/09. https://doi.org/10.1007/978-3-642-04930-9_10
Du J, Qi G, Pan JZ, Shen YD. A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL. In Bernstein A, Karger DR, Heath T, Feigenbaum L, Maynard D, Motta E, Thirunarayan K, editors, The Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings. Springer Verlag. 2009. p. 146-162. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-04930-9_10
Du, Jianfeng ; Qi, Guilin ; Pan, Jeff Z. ; Shen, Yi Dong. / A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL. The Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings. editor / Abraham Bernstein ; David R. Karger ; Tom Heath ; Lee Feigenbaum ; Diana Maynard ; Enrico Motta ; Krishnaprasad Thirunarayan. Springer Verlag, 2009. pp. 146-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4c8921fcb57a43938045c97e6f38aeed,
title = "A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL",
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 OWLDL 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.",
author = "Jianfeng Du and Guilin Qi and Pan, {Jeff Z.} and Shen, {Yi Dong}",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-04930-9_10",
language = "English",
isbn = "364204929X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "146--162",
editor = "Bernstein, {Abraham } and Karger, {David R.} and Tom Heath and Feigenbaum, {Lee } and Diana Maynard and Enrico Motta and Thirunarayan, {Krishnaprasad }",
booktitle = "The Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings",
address = "Germany",

}

TY - GEN

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

AU - Du, Jianfeng

AU - Qi, Guilin

AU - Pan, Jeff Z.

AU - Shen, Yi Dong

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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 OWLDL 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.

AB - 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 OWLDL 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.

UR - http://www.scopus.com/inward/record.url?scp=78650442777&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-04930-9_10

DO - 10.1007/978-3-642-04930-9_10

M3 - Conference contribution

SN - 364204929X

SN - 9783642049293

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 146

EP - 162

BT - The Semantic Web, ISWC 2009 - 8th International Semantic Web Conference, ISWC 2009, Proceedings

A2 - Bernstein, Abraham

A2 - Karger, David R.

A2 - Heath, Tom

A2 - Feigenbaum, Lee

A2 - Maynard, Diana

A2 - Motta, Enrico

A2 - Thirunarayan, Krishnaprasad

PB - Springer Verlag

ER -