SPARQL graph pattern rewriting for OWL-DL inference queries

Yixin Jing, Dongwon Jeong, Doo Kwon Baik

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

This paper focuses on the issue of OWL-DL ontology queries implemented in SPARQL. Currently, ontology repositories construct inference ontology models, and match SPARQL queries to the models, to derive inference results. Because an inference model uses much more storage space than the original model, and cannot be reused as inference requirements vary, this method is not suitable for large-scale deployment. To solve this problem, this paper proposes a novel method that passes rewritten SPARQL queries to the original ontology model, to retrieve inference results. We define OWL-DL inference rules and apply them to rewriting Graph Patterns in queries. The paper classifies the inference rules and discusses how these rules affect query rewriting. To illustrate the advantages of our proposal, we present a prototype system based on Jena, and address query optimization, to eliminate the disadvantages of augmented query sentences. We perform a set of query tests and compare the results with related works. The results show that the proposed method results in significantly improved query efficiency, without compromising completeness or soundness.

Original languageEnglish
Pages (from-to)243-262
Number of pages20
JournalKnowledge and Information Systems
Volume20
Issue number2
DOIs
Publication statusPublished - 2009 Jan 1

Fingerprint

Ontology

Keywords

  • Graph pattern
  • Ontology inference
  • OWL-DL
  • Query rewriting
  • Semantic web
  • SPARQL

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Information Systems
  • Hardware and Architecture
  • Human-Computer Interaction

Cite this

SPARQL graph pattern rewriting for OWL-DL inference queries. / Jing, Yixin; Jeong, Dongwon; Baik, Doo Kwon.

In: Knowledge and Information Systems, Vol. 20, No. 2, 01.01.2009, p. 243-262.

Research output: Contribution to journalArticle

Jing, Yixin ; Jeong, Dongwon ; Baik, Doo Kwon. / SPARQL graph pattern rewriting for OWL-DL inference queries. In: Knowledge and Information Systems. 2009 ; Vol. 20, No. 2. pp. 243-262.
@article{f4438da6e0104bf1bc8427c243d6c841,
title = "SPARQL graph pattern rewriting for OWL-DL inference queries",
abstract = "This paper focuses on the issue of OWL-DL ontology queries implemented in SPARQL. Currently, ontology repositories construct inference ontology models, and match SPARQL queries to the models, to derive inference results. Because an inference model uses much more storage space than the original model, and cannot be reused as inference requirements vary, this method is not suitable for large-scale deployment. To solve this problem, this paper proposes a novel method that passes rewritten SPARQL queries to the original ontology model, to retrieve inference results. We define OWL-DL inference rules and apply them to rewriting Graph Patterns in queries. The paper classifies the inference rules and discusses how these rules affect query rewriting. To illustrate the advantages of our proposal, we present a prototype system based on Jena, and address query optimization, to eliminate the disadvantages of augmented query sentences. We perform a set of query tests and compare the results with related works. The results show that the proposed method results in significantly improved query efficiency, without compromising completeness or soundness.",
keywords = "Graph pattern, Ontology inference, OWL-DL, Query rewriting, Semantic web, SPARQL",
author = "Yixin Jing and Dongwon Jeong and Baik, {Doo Kwon}",
year = "2009",
month = "1",
day = "1",
doi = "10.1007/s10115-008-0169-8",
language = "English",
volume = "20",
pages = "243--262",
journal = "Knowledge and Information Systems",
issn = "0219-1377",
publisher = "Springer London",
number = "2",

}

TY - JOUR

T1 - SPARQL graph pattern rewriting for OWL-DL inference queries

AU - Jing, Yixin

AU - Jeong, Dongwon

AU - Baik, Doo Kwon

PY - 2009/1/1

Y1 - 2009/1/1

N2 - This paper focuses on the issue of OWL-DL ontology queries implemented in SPARQL. Currently, ontology repositories construct inference ontology models, and match SPARQL queries to the models, to derive inference results. Because an inference model uses much more storage space than the original model, and cannot be reused as inference requirements vary, this method is not suitable for large-scale deployment. To solve this problem, this paper proposes a novel method that passes rewritten SPARQL queries to the original ontology model, to retrieve inference results. We define OWL-DL inference rules and apply them to rewriting Graph Patterns in queries. The paper classifies the inference rules and discusses how these rules affect query rewriting. To illustrate the advantages of our proposal, we present a prototype system based on Jena, and address query optimization, to eliminate the disadvantages of augmented query sentences. We perform a set of query tests and compare the results with related works. The results show that the proposed method results in significantly improved query efficiency, without compromising completeness or soundness.

AB - This paper focuses on the issue of OWL-DL ontology queries implemented in SPARQL. Currently, ontology repositories construct inference ontology models, and match SPARQL queries to the models, to derive inference results. Because an inference model uses much more storage space than the original model, and cannot be reused as inference requirements vary, this method is not suitable for large-scale deployment. To solve this problem, this paper proposes a novel method that passes rewritten SPARQL queries to the original ontology model, to retrieve inference results. We define OWL-DL inference rules and apply them to rewriting Graph Patterns in queries. The paper classifies the inference rules and discusses how these rules affect query rewriting. To illustrate the advantages of our proposal, we present a prototype system based on Jena, and address query optimization, to eliminate the disadvantages of augmented query sentences. We perform a set of query tests and compare the results with related works. The results show that the proposed method results in significantly improved query efficiency, without compromising completeness or soundness.

KW - Graph pattern

KW - Ontology inference

KW - OWL-DL

KW - Query rewriting

KW - Semantic web

KW - SPARQL

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

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

U2 - 10.1007/s10115-008-0169-8

DO - 10.1007/s10115-008-0169-8

M3 - Article

VL - 20

SP - 243

EP - 262

JO - Knowledge and Information Systems

JF - Knowledge and Information Systems

SN - 0219-1377

IS - 2

ER -