Article

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

Authors:

Yi-Dong ShenAuthors Info & Claims

ISWC '09: Proceedings of the 8th International Semantic Web Conference

Pages 146 - 162

https://doi.org/10.1007/978-3-642-04930-9_10

Published: 06 November 2009 Publication History

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.

References

[1]

Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL - Lite: Tractable description logics for ontologies. In: Proc. of AAAI 2005, pp. 602-607 (2005)

[2]

Dolby, J., Fokoue, A., Kalyanpur, A., Kershenbaum, A., Schonberg, E., Srinivas, K., Ma, L.: Scalable semantic retrieval through summarization and refinement. In: Proc. of AAAI 2007, pp. 299-304 (2007)

[3]

Dolby, J., Fokoue, A., Kalyanpur, A., Ma, L., Schonberg, E., Srinivas, K., Sun, X.: Scalable grounded conjunctive query evaluation over large and expressive knowledge bases. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 403-418. Springer, Heidelberg (2008)

[4]

Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Proc. of LPNMR 1997, pp. 364-375 (1997)

[5]

Fitting, M.: First-order Logic and Automated Theorem Proving, 2nd edn. Springer, New York (1996)

[6]

Cuenca Grau, B., Parsia, B., Sirin, E., Kalyanpur, A.: Modularity and web ontologies. In: Proc. of KR 2006, pp. 198-209 (2006)

[7]

Guo, Y., Heflin, J.: A scalable approach for partitioning OWL knowledge bases. In: Proc. of SSWS 2006, pp. 47-60 (2006)

[8]

Guo, Y., Pan, Z., Heflin, J.: LUBM: A benchmark for OWL knowledge base systems. Journal of Web Semantics 3(2-3), 158-182 (2005)

[9]

Kazakov, Y., Motik, B.: A resolution-based decision procedure for SHOIQ. Journal of Automated Reasoning 40(2-3), 89-116 (2008)

[10]

Ma, L., Yang, Y., Qiu, Z., Xie, G., Pan, Y., Liu, S.: Towards a complete OWL ontology benchmark. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 125-139. Springer, Heidelberg (2006)

[11]

Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Univesität karlsruhe, Germany (January 2006)

[12]

Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. Journal of Web Semantics 3(1), 41-60 (2005)

[13]

Pan, J.Z., Thomas, E.: Approximating OWL-DL ontologies. In: Proc. of AAAI 2007, pp. 1434-1439 (2007)

[14]

Sirin, E., Parsia, B., Cuenca Grau, B., Kalyanpur, A., Katz, Y.: Pellet: A practical OWL-DL reasoner. Journal of Web Semantics 5(2), 51-53 (2007)

[15]

Stuckenschmidt, H., Klein, M.: Structure-based partitioning of large concept hierarchies. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 289-303. Springer, Heidelberg (2004)

Cited By

Du JQi GPan JShen Y(2012)Approximating Linear Order Inference in OWL 2 DL by Horn CompilationProceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 0110.5555/2457524.2457668(97-104)Online publication date: 4-Dec-2012
https://dl.acm.org/doi/10.5555/2457524.2457668

Index Terms

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

Recommendations

Paraconsistent query answering over DL-Lite ontologies

Consistent query answering over description logic based ontologies is an important topic in ontology engineering as it can provide meaningful answers to queries posed over inconsistent ontologies. Current approaches for dealing with this problem usually ...
Optimizing query answering over OWL ontologies
ESWC'11: Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II

Query answering is a key reasoning task for many ontology based applications in the Semantic Web. Unfortunately for OWL, the worst case complexity of query answering is very high. That is why, when the schema of an ontology is written in a highly ...
Conjunctive query answering in distributed ontology systems for ontologies with large OWL ABoxes
OWLED'09: Proceedings of the 6th International Conference on OWL: Experiences and Directions - Volume 529

We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed over a set of autonomous nodes. We focus on ontologies with large ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

ISWC '09: Proceedings of the 8th International Semantic Web Conference

November 2009

1004 pages

ISBN:9783642049293

Editors:
Abraham Bernstein
Wirtschaftswissenschaftliche Fakultät, Institut für Informatik, Universität Zürich, Zurich, Switzerland 8050
,
David R. Karger
Computer Science and Artificial Intelligene Laboratory, Massachusetts Institute of Technology, Cambridge, USA
,
Tom Heath
Talis Information Ltd., knights Court, Solihull Parkway, Birmingham Business Park, UK B37 7YB
,
Lee Feigenbaum
Cambridge Semantics Inc., Cambridge, USA 02142
,
Diana Maynard
Computer Science Department, University of Sheffield, Sheffield, UK S1 4DP
,
Enrico Motta
Knowledge Media Institute (KMi), The Open University, Milton Keynes, UK
,
Krishnaprasad Thirunarayan
Department of Computer Science and Engineering, Wright State University, Metadata and Lanugages Laboratory, Dayton, USA 45435

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 06 November 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Du JQi GPan JShen Y(2012)Approximating Linear Order Inference in OWL 2 DL by Horn CompilationProceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 0110.5555/2457524.2457668(97-104)Online publication date: 4-Dec-2012
https://dl.acm.org/doi/10.5555/2457524.2457668

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents