Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
¿ÂÅç·ÎÁö Ãß·Ð ¸ðµ¨¿¡ µ¶¸³ÀûÀÎ SPARQL Ãß·Ð ÁúÀÇ Ã³¸®¸¦ À§ÇÑ ÀçÀÛ¼º ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
A Rewriting Algorithm for Inferrable SPARQL Query Processing Independent of Ontology Inference Models |
ÀúÀÚ(Author) |
Á¤µ¿¿ø
Yixin Jing
¹éµÎ±Ç
Dongwon Jeong
Yixin Jing
Doo-Kwon Baik
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 35 NO. 06 PP. 0505 ~ 0517 (2008. 12) |
Çѱ۳»¿ë (Korean Abstract) |
ÀÌ ³í¹®¿¡¼´Â SPARQL·Î ÀÛ¼ºµÈ OWL-DL ¿ÂÅç·ÎÁö ÁúÀÇ¿¡ ´ëÇÑ ÀçÀÛ¼º ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ÇöÀç À¥ ¿ÂÅç·ÎÁö ÀúÀå¼Ò´Â ÁÖ¾îÁø SPARQL ÁúÀÇÀÇ Ãß·Ð °á°ú¸¦ ¾ò±â À§ÇØ Ãß·Ð ¿ÂÅç·ÎÁö ¸ðµ¨À» »ý¼ºÇÏ°í SPARQL ÁúÀÇ¿Í »ý¼ºµÈ Ãß·Ð ¿ÂÅç·ÎÁö ¸ðµ¨°úÀÇ ÀÏÄ¡¼ºÀ» ºñ±³ÇÑ´Ù. Ãß·Ð ¸ðµ¨Àº º£À̽º ¿ÂÅç·ÎÁö ¸ðµ¨¿¡ ºñÇØ º¸´Ù Å« °ø°£À» ÇÊ¿ä·Î ÇÏ°í ´Ù¸¥ Ãß·Ð ÁúÀǸ¦ À§ÇØ Àç»ç¿ëµÉ ¼ö ¾ø±â ¶§¹®¿¡ ¾Õ¼ ¾ð±ÞÇÑ Á¢±Ù ¹æ¹ýÀº º¸´Ù ¹æ´ëÇÑ Å©±âÀÇ SPARQL ÁúÀÇ Ã³¸®¿¡ ºÎÀûÇÕÇÏ´Ù. ÀÌ·¯ÇÑ ¹®Á¦Á¡À» ÇØ°áÇϱâ À§ÇØ ÀÌ ³í¹®¿¡¼´Â SPARQL ÁúÀǸ¦ ÀçÀÛ¼ºÇÏ°í À̸¦ ±âº» º£À̽º ¿ÂÅç·ÎÁö ¸ðµ¨¿¡ ´ëÇØ ÁúÀÇ ¿¬»êÀ» ¼öÇàÇÏ¿© °á°ú¸¦ ȹµæÇÒ ¼ö ÀÖ´Â SPARQL ÀçÀÛ¼º ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ÀÌ·¯ÇÑ ¸ñÀûÀ» ÀÌ·ç±â À§ÇØ, ¸ÕÀú OWL-DL Ãß·Ð ±ÔÄ¢À» Á¤ÀÇÇÏ°í À̸¦ ÁúÀÇ ±×·¡ÇÁ ÆÐÅÏ ÀçÀÛ¼º¿¡ Àû¿ëÇÑ´Ù. ¶ÇÇÑ Ãß·Ð ±ÔÄ¢µéÀ» ºÐ·ùÇÏ°í ÀÌ·¯ÇÑ ±ÔÄ¢µéÀÌ ÁúÀÇ ÀçÀÛ¼º¿¡ ¹ÌÄ¡´Â ¿µÇâ¿¡ ´ëÇÏ¿© ±â¼úÇÑ´Ù. Á¦¾È ¾Ë°í¸®ÁòÀÇ ÀåÁ¡À» º¸À̱â À§ÇØ, Jena ±â¹ÝÀÇ ÇÁ·ÎÅäŸÀÔ ½Ã½ºÅÛÀ» ±¸ÇöÇÑ´Ù. ºñ±³ Æò°¡¸¦ À§ÇØ Å×½ºÆ® ÁúÀǸ¦ ÀÌ¿ëÇÏ¿© ½ÇÇèÀ» ¼öÇàÇÏ°í Á¦¾È ¹æ¹ý°ú ±âÁ¸ Á¢±Ù ¹æ¹ýÀ» ºñ±³ÇÑ´Ù. ½ÇÇè °á°ú¿¡¼, Á¦¾È ¾Ë°í¸®ÁòÀÌ ¿ÏÀü¼º ¹× Á¤È®¼ºÀÇ ¼Õ½Ç¾øÀÌ ¸Þ¸ð¸® °ø°£ ¹× ¿ÂÅç·ÎÁö ·Îµù Ãø¸é¿¡¼ Çâ»óµÈ ¼º´ÉÀ» º¸¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
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 this 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 Jena 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. |
Å°¿öµå(Keyword) |
ÁúÀÇ ÀçÀÛ¼º
±×·¡ÇÁ ÆÐÅÏ
À¥ ¿ÂÅç·ÎÁö
SPARQL
Ãß·Ð
OWL-DL
½Ã¸Çƽ À¥
Web ontology
SPARQL
Inference
OWL-DL
Query Rewriting
Graph Pattern
Semantic Web
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|