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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö > Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö D

Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö D

Current Result Document : 3 / 15 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) XML ¹®¼­ÀÇ À¯»ç °æ·Î °Ë»öÀ» À§ÇÑ Àε¦½Ì ½Ã½ºÅÛ
¿µ¹®Á¦¸ñ(English Title) An Indexing System for Retrieving Similar Paths in XML Documents
ÀúÀÚ(Author) À̹ü¼®   Ȳº´¿¬   Bumsuk Lee   Byungyeon Hwang  
¿ø¹®¼ö·Ïó(Citation) VOL 15-D NO. 02 PP. 0171 ~ 0178 (2008. 04)
Çѱ۳»¿ë
(Korean Abstract)
1998³â W3C¿¡ ÀÇÇØ XML Ç¥ÁØÀÌ Á¦Á¤µÈ ÀÌ·¡·Î, XMLÀ» »ç¿ëÇÏ´Â ¹®¼­°¡ ±ÞÁõÇÏ¿´´Ù. ÀÌ¿¡ µû¶ó ¹æ´ëÇÑ ¾çÀÇ XML ¹®¼­µéÀ» È¿À²ÀûÀ¸·Î °ü¸®ÇÏ°í °Ë»öÇϱâ À§ÇÑ ¸¹Àº ½Ã½ºÅÛµéÀÌ °³¹ßµÇ°í ÀÖ´Ù. ƯÈ÷ ºñÆ®¸Ê À妽º ±â¹ýÀ» »ç¿ëÇÑ BitCube´Â ÀÌ·¯ÇÑ ºÐ¾ßÀÇ ´ëÇ¥ÀûÀÎ ½Ã½ºÅÛÀÌ´Ù. ºñÆ®¸Ê À妽º ±â¹ýÀ» ÀÌ¿ëÇÏ¿© À¯»çÇÑ °æ·Î¸¦ ´ë»óÀ¸·Î Ŭ·¯½ºÅ͸µÀ» ¼öÇàÇÑ °æ·Î ºñÆ®¸Ê À妽º ½Ã½ºÅÛ(LH06)Àº ±âÁ¸ÀÇ BitCube ½Ã½ºÅÛÀÌ À¯»ç°æ·Î °Ë»öÀ» ÇÒ ¼ö ¾ø´Â ¹®Á¦Á¡À» °³¼±ÇÏ¿´´Ù. À¯»ç°æ·Î °Ë»ö ½Ã½ºÅÛÀº Á¤È®È÷ ÀÏÄ¡ÇÏ´Â °æ·Î»Ó¸¸ ¾Æ´Ï¶ó, »ç¿ëÀÚ°¡ ÁúÀÇÇÑ °æ·Î¿Í À¯»çÇÑ °æ·Î±îÁöµµ ºü¸£°Ô °Ë»öÇØ ³¾ ¼ö ÀÖ´Ù´Â ÀåÁ¡À» °¡Áø´Ù. ±×·¯³ª °æ·Î »çÀÌÀÇ À¯»çµµ¸¦ °è»êÇÏ´Â ¾Ë°í¸®ÁòÀÌ °¡Áø ¸î °¡Áö ¹®Á¦Á¡µé·Î ÀÎÇØ À¯»çÇÏ´Ù°í º¼ ¼ö ÀÖ´Â µÎ °æ·ÎÀÇ À¯»çµµ¸¦ °è»êÇÒ ¼ö ¾ø¾î¼­ ¼­·Î ´Ù¸¥ Ŭ·¯½ºÅÍ·Î Àνĵǰí, ÀÌ´Â ÀÇ¹Ì ¾ø´Â Ŭ·¯½ºÅÍÀÇ ¼ö¸¦ Áõ°¡½ÃÅ°´Â ¹®Á¦Á¡À» ¾ß±âÇÑ´Ù. ÀÌ·¯ÇÑ ¹®Á¦Á¡ÀÇ ÇØ°áÀ» À§ÇØ º» ³í¹®¿¡¼­´Â º¸´Ù ÇÕ¸®ÀûÀÌ°í Á¤È®ÇÑ °æ·Î À¯»çµµ °è»ê ¹æ¹ýÀ» Á¦¾ÈÇÏ°í, ±âÁ¸ ½Ã½ºÅÛ°úÀÇ ¼º´ÉÆò°¡¸¦ ÅëÇØ Á¦¾ÈÇÏ´Â ¹æ¹ýÀÌ ´õ ³´´Ù´Â °ÍÀ» Áõ¸íÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
Since the XML standard was introduced by the W3C in 1998, documents that have been written in XML have been gradually increasing. Accordingly, several systems have been developed in order to efficiently manage and retrieve massive XML documents. BitCube?a bitmap indexing system? is a representative system for this field of research. Based on the bitmap indexing technique, the path bitmap indexing system(LH06), which performs the clustering of similar paths, improved the problem that the existing BitCube system could not solve, namely, determining similar paths. The path bitmap indexing system has the advantage of a higher retrieval speed in not only exactly matched path searching but also similar path searching. However, the similarity calculation algorithm of this system has a few particular problems. Consequently, it sometimes cannot calculate the similarity even though some of two paths have extremely similar relationships; further, it results in an increment in the number of meaningless clusters. In this paper, we have proposed a novel method that calculates the similarity between the paths in order to solve these problems. The proposed system yields a stable result for clustering, and it obtains a high score in clustering precision during a performance evaluation against LH06.
Å°¿öµå(Keyword) XML   Àε¦½Ì ½Ã½ºÅÛ   À¯»ç °æ·Î   Ŭ·¯½ºÅ͸µ   Indexing System   Similar Path   Clustering  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå