Parallelization of Query Processing over Expressive Ontologies

E. Patrick Shironoshita, Da Zhang, Mansur R. Kabuka, Jia Xu

Research output: Contribution to journalArticle

Abstract

Efficient query answering over Description Logic (DL) ontologies with very large datasets is becoming increasingly vital. Recent years have seen the development of various approaches to ABox partitioning to enable parallel processing. Instance checking using the enhanced most specific concept (MSC) method is a particularly promising approach. The applicability of these distributed reasoning methods to typical ontologies has been shown mainly through anecdotal observation. In this paper, we present an analysis method that makes use of random graph theory to show that the enhanced MSC method results in very small, tractable concepts provided that the number of role assertions removed from consideration is large enough. We also present execution time and efficiency of a parallel implementation deployed over computing clusters of various sizes, showing the ability of the method to process instance checking for large scale datasets.

Original languageEnglish (US)
Pages (from-to)116-126
Number of pages11
JournalCEUR Workshop Proceedings
Volume2029
StatePublished - Jan 1 2017

Fingerprint

Query processing
Ontology
Cluster computing
Graph theory
Processing

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Patrick Shironoshita, E., Zhang, D., Kabuka, M. R., & Xu, J. (2017). Parallelization of Query Processing over Expressive Ontologies. CEUR Workshop Proceedings, 2029, 116-126.

Parallelization of Query Processing over Expressive Ontologies. / Patrick Shironoshita, E.; Zhang, Da; Kabuka, Mansur R.; Xu, Jia.

In: CEUR Workshop Proceedings, Vol. 2029, 01.01.2017, p. 116-126.

Research output: Contribution to journalArticle

Patrick Shironoshita, E, Zhang, D, Kabuka, MR & Xu, J 2017, 'Parallelization of Query Processing over Expressive Ontologies', CEUR Workshop Proceedings, vol. 2029, pp. 116-126.
Patrick Shironoshita E, Zhang D, Kabuka MR, Xu J. Parallelization of Query Processing over Expressive Ontologies. CEUR Workshop Proceedings. 2017 Jan 1;2029:116-126.
Patrick Shironoshita, E. ; Zhang, Da ; Kabuka, Mansur R. ; Xu, Jia. / Parallelization of Query Processing over Expressive Ontologies. In: CEUR Workshop Proceedings. 2017 ; Vol. 2029. pp. 116-126.
@article{0a8419d2f9364afbb7d793326bf5ad77,
title = "Parallelization of Query Processing over Expressive Ontologies",
abstract = "Efficient query answering over Description Logic (DL) ontologies with very large datasets is becoming increasingly vital. Recent years have seen the development of various approaches to ABox partitioning to enable parallel processing. Instance checking using the enhanced most specific concept (MSC) method is a particularly promising approach. The applicability of these distributed reasoning methods to typical ontologies has been shown mainly through anecdotal observation. In this paper, we present an analysis method that makes use of random graph theory to show that the enhanced MSC method results in very small, tractable concepts provided that the number of role assertions removed from consideration is large enough. We also present execution time and efficiency of a parallel implementation deployed over computing clusters of various sizes, showing the ability of the method to process instance checking for large scale datasets.",
author = "{Patrick Shironoshita}, E. and Da Zhang and Kabuka, {Mansur R.} and Jia Xu",
year = "2017",
month = "1",
day = "1",
language = "English (US)",
volume = "2029",
pages = "116--126",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

TY - JOUR

T1 - Parallelization of Query Processing over Expressive Ontologies

AU - Patrick Shironoshita, E.

AU - Zhang, Da

AU - Kabuka, Mansur R.

AU - Xu, Jia

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Efficient query answering over Description Logic (DL) ontologies with very large datasets is becoming increasingly vital. Recent years have seen the development of various approaches to ABox partitioning to enable parallel processing. Instance checking using the enhanced most specific concept (MSC) method is a particularly promising approach. The applicability of these distributed reasoning methods to typical ontologies has been shown mainly through anecdotal observation. In this paper, we present an analysis method that makes use of random graph theory to show that the enhanced MSC method results in very small, tractable concepts provided that the number of role assertions removed from consideration is large enough. We also present execution time and efficiency of a parallel implementation deployed over computing clusters of various sizes, showing the ability of the method to process instance checking for large scale datasets.

AB - Efficient query answering over Description Logic (DL) ontologies with very large datasets is becoming increasingly vital. Recent years have seen the development of various approaches to ABox partitioning to enable parallel processing. Instance checking using the enhanced most specific concept (MSC) method is a particularly promising approach. The applicability of these distributed reasoning methods to typical ontologies has been shown mainly through anecdotal observation. In this paper, we present an analysis method that makes use of random graph theory to show that the enhanced MSC method results in very small, tractable concepts provided that the number of role assertions removed from consideration is large enough. We also present execution time and efficiency of a parallel implementation deployed over computing clusters of various sizes, showing the ability of the method to process instance checking for large scale datasets.

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

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

M3 - Article

AN - SCOPUS:85040617293

VL - 2029

SP - 116

EP - 126

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -