• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.29-45
• /
• 2015

This paper proposes an implementation of SPARQL-DL, which is a query language for OWL ontologies, for query-answering over the OWL ontologies virtually generated from existing RDBs. The proposed SPARQL-DL processor internally translates input SPARQL-DL queries into SQL queries and then executes the translated queries. There are two advantages in the query processing method. First, another repository to store OWL ontologies generated from RDBs is not required. Second, a large ABox generated from an RDB instance is able to be served without using Tableau algorithm based reasoners which have a problem in large ABox reasoning. Our algorithm for query rewriting is designed to create one corresponding SQL query from one input SPARQL-DL query to minimize the overhead by establishing connections with RDBs.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.505-517
• /
• 2008

This paper proposes a rewriting algorithm of OWL-DL ontology query in SPARQL. Currently, to obtain inference results of given SPARQL queries, Web ontology repositories construct inference ontology models and match the SPARQL queries with the models. However, an inference model requires much larger space than its original base model, and reusability of the model is not available for other inferrable SPARQL queries. Therefore, the aforementioned approach is not suitable for large scale SPARQL query processing. To resolve tills issue, this paper proposes a novel SPARQL query rewriting algorithm that can obtain results by rewriting SPARQL queries and accomplishing query operations against the base ontology model. To achieve this goal, we first define OWL-DL inference rules and apply them on rewriting graph pattern in queries. The paper categorizes the inference rules and discusses on how these rules affect the query rewriting. To show the advantages of our proposal, a prototype system based on lena is implemented. For comparative evaluation, we conduct an experiment with a set of test queries and compare of our proposal with the previous approach. The evaluation result showed the proposed algorithm supports an improved performance in efficiency of the inferrable SPARQL query processing without loss of completeness and soundness.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.277-285
• /
• 2007

본 연구는 시맨틱웹 응용의 중심 기술인 웹 온톨로지의 표현과 추론을 위해 서술 논리와 규칙언어를 기반으로하는 웹 온톨로지 모델링 방법을 제안한다. 현재 웹 온톨로지 표현 언어인 OWL DL은 서술 논리에 근거하여 표현되는 것이나, 기계나 온톨로지 공학자가 OWL로 기술된 온톨로지를 직관적으로 이해하고 공유할 수 있는 형식적이고 명시적인 온톨로지의 지식 표현은 부족한 실정이다. 따라서 본 연구는 시맨틱웹이 목적하는 웹 온톨로지 구축을 위한 웹 온톨로지 모델링 방법으로 웹 온톨로지 모델링 계층을 제안하고, 제안된 각 계층에 따라 서술 논리의 TBox와 ABox의 구조와 SWRL을 기반으로 지식을 표현하는 웹 온톨로지 모델링 방법을 제안한다. 제안된 웹 온톨로지 모델링 방법의 성능 검증을 위해 제안 방법에 따라 웹 온톨로지를 구축하였고, SPARQL과 TopBraid의 DL Inference를 이용하여 구축된 웹 온톨로지의 성능을 검증하였다.