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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)

Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)

Current Result Document : 4 / 14 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) µ¿Çü ¼­ºê±×·¡ÇÁ ÁúÀÇ Ã³¸®¸¦ À§ÇÑ È¿À²ÀûÀÎ ±×·¡ÇÁ °æ·Î ±â¹Ý Àε¦½Ì ±â¹ý
¿µ¹®Á¦¸ñ(English Title) An Efficient Path-based Indexing Technique for Subgraph Isomorphism Query Processing
ÀúÀÚ(Author) ±èµ¿Çö   ¼Û±¤È£   ±èÀ¯¼º   DongHyun Kim   Kwangho Song   Yoo-sung Kim   ÇÏÅÂ¿í   ±è¸íÈ£   Tae Wook Ha   Myoung Ho Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 24 NO. 05 PP. 0245 ~ 0250 (2018. 05)
Çѱ۳»¿ë
(Korean Abstract)
µ¿Çü ¼­ºê±×·¡ÇÁ ÁúÀÇ Ã³¸®(Subgraph isomorphism query processing)¶õ ´ë¿ë·®ÀÇ ¿©·¯ ÀÛÀº ±×·¡ÇÁµé ȤÀº ÇϳªÀÇ Å« ±×·¡ÇÁ·Î ÀÌ·ç¾îÁø ±×·¡ÇÁ µ¥ÀÌÅͺ£À̽º¿¡ ´ëÇØ »ç¿ëÀڷκÎÅÍ ÁÖ¾îÁø ÁúÀÇ ±×·¡ÇÁ¿Í ±¸Á¶ÀûÀ¸·Î µ¿ÀÏÇÑ(isomorphic) ¿©·¯ ¼­ºê±×·¡ÇÁµéÀ» ã¾ÆÁÖ´Â °úÁ¤ÀÌ´Ù. ±âÁ¸ ¿¬±¸¿¡¼­´Â ±×·¡ÇÁ °æ·Î(path) ±â¹Ý À妽º¿Í °¢ °æ·Î¿¡ ´ëÇÑ Å×ÀÌºí °£ Á¶ÀÎ(join) ¿¬»êÀ» ÅëÇØ ÁúÀǸ¦ ó¸®ÇÏ´Â ¹æ¹ýÀ» Á¦¾È ÇÏ¿´´Ù. ÇÏÁö¸¸ µ¿ÀÏÇÑ ±¸Á¶À̰ųª °øÅë ¿¡Áö(edge)¸¦ °¡Áö´Â °æ·ÎµéÀÇ °æ¿ì µ¥ÀÌÅÍ ±×·¡ÇÁ¿¡ ´ëÇÑ Áߺ¹Á¤º¸¸¦ °¡Á® À妽ºÀÇ Å©±â°¡ ºÒÇÊ¿äÇÏ°Ô Ä¿Áö´Â ¹®Á¦Á¡ÀÌ ÀÖ´Ù. º» ³í¹®¿¡¼­´Â Æнº ÄÚµå(path-code)¿Í À¯´ÏÅ© Äڵ带(unique-code)¸¦ ÀÌ¿ëÇÏ¿© µ¥ÀÌÅÍ ±×·¡ÇÁ¿¡ ´ëÇÑ Áߺ¹ Á¤º¸¸¦ Á¦°ÅÇÏ´Â È¿À²ÀûÀÎ °æ·Î ±â¹Ý Àε¦½Ì ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. ½ÇÇè¿¡¼­´Â ±âÁ¸ °æ·Î ±â¹ÝÀÇ Àε¦½Ì ¹æ¹ý°ú ºñ±³ÇÏ¿© Á¦¾ÈÇÑ Àε¦½Ì ¹æ¹ýÀÇ È¿À²¼ºÀ» º¸ÀδÙ. ¶ÇÇÑ, ½ÇÁ¦ ±×·¡ÇÁ µ¥ÀÌÅͺ£À̽º¿¡ ´ëÇØ Á¦¾ÈÇÑ ¹æ¹ýÀÌ ºü¸¥ ÁúÀÇ Ã³¸®¸¦ °¡ÁüÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
Given a graph database which consists of small graphs or a single large graph, the subgraph isomorphism query processing finds all subgraphs isomorphic to a query graph from a user. The previous research proposed a query processing method using join operations between tables, which include path information of a database graph, from a path-based index. However, there is a problem if the index contains a lot of duplicate information because of paths that are the same or have common edges. In this paper, we propose an efficient path-based indexing technique without duplicate information using a path-code and a unique-code of a path. In the experiments, we show the effectiveness of our proposed method by comparing it with the previous indexing method. We also show that our method does a fast query processing on real graph databases.
Å°¿öµå(Keyword) ºñµð¿À ÁÖ¼® »ý¼º ½Ã½ºÅÛ   ÀÚµ¿ ºñµð¿À ÁÖ¼® »ý¼º   ¿ÜºÎ Àνı⠿¬µ¿ API   »óȲ ÀνĿë Áö»ó ½ÇÃø µ¥ÀÌÅÍ Á¦ÀÛ   ¿ÜºÎ À̹ÌÁö Àνı⠿¬µ¿   video annotation system   automatic video annotation generation   third-party detector linking API   ground truth data for event recognition   third-party image detector linking   ±×·¡ÇÁ   µ¿Çü ¼­ºê±×·¡ÇÁ ÁúÀÇ Ã³¸®   °æ·Î ±â¹Ý Àε¦½Ì   Æнº Äڵ堠 À¯´ÏÅ© Äڵ堠 graph   subgraph isomorphism query processing   path-based index   path-code   unique-code  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå