Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
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 ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.