• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º

Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) »ç¿ëÀÚ »óÈ£ÀÛ¿ë¿¡ ±â¹ÝÇÑ ±×·¡ÇÁ ÁúÀÇ »ý¼º ¹× ó¸®
¿µ¹®Á¦¸ñ(English Title) User Interaction-based Graph Query Formulation and Processing
ÀúÀÚ(Author) Á¤¼ºÀç   ±èÅÂÈ«   À̽¿젠 ÀÌÈ­½Ä   Á¤ÇѹΠ  Sung-Jae Jung   Taehong Kim   Seungwoo Lee   Hwasik Lee   Hanmin Jung  
¿ø¹®¼ö·Ïó(Citation) VOL 41 NO. 04 PP. 0242 ~ 0248 (2014. 08)
Çѱ۳»¿ë
(Korean Abstract)
RDF µ¥ÀÌÅÍ°¡ ±Þ¼ÓÈ÷ Áõ°¡ÇÔ¿¡ µû¶ó RDF µ¥ÀÌÅͷκÎÅÍ Á¤º¸¸¦ È¿À²ÀûÀ¸·Î ÃßÃâÇÏ´Â ±â¼úÀÇ Á߿伺µµ Á¡Â÷ Ä¿Áö°í ÀÖ´Ù.RDF µ¥ÀÌÅÍ ÁúÀǸ¦ À§ÇØ °¡Àå ¸¹ÀÌ »ç¿ëÇÏ´Â ÁúÀÇ ¾ð¾îÀÎ SPARQLÀº ¹®¹ýÀÌ °£´ÜÇÏ°í ±×·¡ÇÁ ÆÐÅÏÀ» ¼Õ½±°Ô ÁúÀǷΠǥÇöÇÒ ¼ö ÀÖ´Â ÀåÁ¡ÀÌ ÀÖ´Ù. ±×·¯³ª »ç¿ëÀÚ°¡ ÀûÀýÇÑ SPARQLÀ» ÀÛ¼ºÇÏ·Á¸é µ¥ÀÌÅÍ ¼Â¿¡ ´ëÇÑ ¿ÂÅç·ÎÁö ±¸Á¶¿Í ¿ë¾î¸¦ »çÀü¿¡ ÆľÇÇØ¾ß ÇÑ´Ù. ÀÌ ¿¬±¸¿¡¼­´Âµ¥ÀÌÅÍ ¼ÂÀ¸·ÎºÎÅÍ »çÀü¿¡ ÃßÃâµÈ ½ºÅ°¸¶Á¤º¸¸¦ ÀÌ¿ëÇÑ ±×·¡ÇÁÁúÀÇ »ý¼º ¹× 󸮹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈµÈ ¹æ¹ý¿¡¼­ »ç¿ëÀÚ´Â RDF µ¥ÀÌÅÍ ¼Â¿¡ ´ëÇÑ ¿ÂÅç·ÎÁö ±¸Á¶»çÀü ÆÄ¾Ç ¾øÀÌ È­¸é»ó¿¡¼­ µ¿ÀûÀ¸·Î ÁúÀǸ¦ ÀÛ¼ºÇÏ¿© Á¤º¸¸¦ Á¶È¸ÇÒ ¼ö ÀÖ´Ù. »ç¿ëÀÚ°¡ »ý¼ºÇÑ ÁúÀÇ´Â °ü°èÇü µ¥ÀÌÅͺ£À̽º¿¡ ÀúÀåµÈ Æ®¸®Çà µ¥ÀÌÅÍ¿¡ ´ëÇØ ±×·¡ÇÁ Ž»öÀ» ¼öÇàÇÒ ¶§ Ž»ö°ø°£Á¦¾à Á¶°ÇÀ¸·Î È°¿ëµÈ´Ù. LUBM(10,0)µ¥ÀÌÅÍ ¼Â¿¡ ´ëÇÏ¿© LUBMÁúÀÇ 2,8, 9¹øÀ» ÀÌ¿ëÇÏ¿© ÁúÀÇ Ã³¸® ¼º´É°ú ¿ÏÀü¼ºÀ» È®ÀÎÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
With the rapidly growing amount of information represented in RDF format, efficient querying of RDF graph has become a fundamental challenge. SPARQL is one of the most widely used query languages for retrieving information from RDF dataset. SPARQL is not only simple in its syntax but also powerful in representation of graph pattern queries. However, users need to make a lot of efforts to understand the ontology schema of a dataset in order to compose a relevant SPARQL query. In this paper, we propose a graph query formulation and processing scheme based on ontology schema information which can be obtained by summarizing RDF graph. In the context of the proposed querying scheme, a user can interactively formulate the graph queries on the graphic user interface without making efforts to understand the ontology schema and even without learning SPARQL syntax. The graph query formulated by a user is transformed into a set of class paths, which are stored in a relational database and used as the constraint for search space reduction when the relational database executes the graph search operation. By executing the LUBM query 2, 8, and 9 over LUBM (10,0), it is shown that the proposed querying scheme returns the complete result set.
Å°¿öµå(Keyword) SPARQL   ±×·¡ÇÁÁúÀÇ󸮠  RDF ±×·¡ÇÁ   ±×·¡ÇÁŽ»ö   SPARQL   graph query processing   RDF graph   graph search  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå