Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
ÇѱÛÁ¦¸ñ(Korean Title) |
XML Á¤±Ô °æ·Î½ÄÀ» À§ÇÑ À¯¿¬ÇÑ ÁúÀÇ Ã³¸® ½Ã½ºÅÛ |
¿µ¹®Á¦¸ñ(English Title) |
A Flexible Query Processing System for XML Regular Path Expressions |
ÀúÀÚ(Author) |
±è´ëÀÏ
±è±ââ
±èÀ¯¼º
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 30 NO. 06 PP. 0641 ~ 0650 (2003. 12) |
Çѱ۳»¿ë (Korean Abstract) |
¹Ý ±¸Á¶Àû(semi-structured)À̸ç Ç¥ÇöÀÇ À¯¿¬¼ºÀÌ ³ôÀº XML(eXtensible Markup Language)Àº ÀÎÅͳݿ¡¼ÀÇ Á¤º¸ ±³È¯ÀÇ Ç¥ÁØÀ¸·Î ÀÚ¸®Àâ¾Ò´Ù. ¸¹Àº ¹®¼µéÀÌ XML·Î ÀÛ¼ºµÇ°í ÀÖÀ¸¸ç ÀÌ·¯ÇÑ ¹®¼µé¿¡ ´ëÇÑ È¿À²ÀûÀÎ ÀúÀå°ú °Ë»ö¿¡ ´ëÇÑ ¿ä±¸°¡ Áõ°¡ÇÏ°í ÀÖ´Ù. XML ¹®¼µéÀ» ÀúÀåÇÏ´Â ¹é¿£µå(back-end)·Î¼ ´ë·®ÀÇ Á¤º¸Ã³¸®°¡ °¡´ÉÇÏ°í ȸº¹, µ¿½Ã¼º Á¦¾î µîÀÇ ¼º¼÷µÈ ±â¼úµéÀ» °¡Áö°í ÀÖ´Â °ü°èÇü µ¥ÀÌŸº£À̽º¸¦ ÀÌ¿ëÇÏ´Â ¸¹Àº ¿¬±¸µéÀÌ ÀÖ´Ù. ±âÁ¸ÀÇ °ü°èÇü µ¥ÀÌŸº£À̽º¸¦ ÀÌ¿ëÇÑ ÁúÀÇ Ã³¸® ¹æ¹ýµé¿¡¼´Â ´Ù¾çÇÑ ÁúÀÇ¿¡ ´ëÇØ µ¿ÀÏÇÑ ±¸Á¶ Á¤º¸¿Í ±âº» ¿¬»êÀ» Àû¿ëÇÏ¿© ÁúÀÇ Ã³¸®¸¦ Çϱ⠶§¹®¿¡ ƯÁ¤ÇÑ ÁúÀÇ ÇüŸ¸À» È¿À²ÀûÀ¸·Î ó¸®ÇÒ ¼ö ÀÖ´Ù. º» ³í¹®¿¡¼´Â ÁúÀǸ¦ ºÐ¼®ÇÏ¿© ÁúÀÇ¿¡ ÀûÇÕÇÑ ±¸Á¶ Á¤º¸¿Í ±âº» ¿¬»êÀ» Àû¿ëÇÏ´Â À¯¿¬ÇÑ ÁúÀÇ Ã³¸® ½Ã½ºÅÛÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈµÈ ÁúÀÇ Ã³¸® ½Ã½ºÅÛÀº Á¤±Ô °æ·Î½Ä XML ÁúÀǸ¦ ºÐ¼®ÇÏ¿© ºÎ¸ð-ÀÚ½Ä °ü°è Æľǿ¡´Â µ¿µî(equi)-Á¶ÀÎÀ» »ç¿ëÇÏ°í ºÎ¸ð-ÀÚ½Ä °ü°è°¡ ¾Æ´Ñ Á¶»ó-ÀÚ¼Õ °ü°è¿¡´Â ¥è-Á¶ÀÎÀ» »ç¿ëÇÏ¿© ´Ù¾çÇÑ Á¤±Ô °æ·Î½Ä ÁúÀǸ¦ È¿À²ÀûÀ¸·Î ó¸®ÇÑ´Ù. Á¦¾ÈµÈ XML ÁúÀÇ Ã³¸® ½Ã½ºÅÛ°ú ±âÁ¸ÀÇ °ü°èÇü µ¥ÀÌŸº£À̽º¸¦ ÀÌ¿ëÇÏ´Â ÁúÀÇ Ã³¸® ½Ã½ºÅÛÀ» ºñ±³ ½ÇÇèÇÑ °á°ú ´Ù¾çÇÑ Á¤±Ô °æ·Î½Ä ÁúÀÇ Ã³¸®ÀÇ ¼º´É Çâ»óÀ» º¸¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
The eXtensible Markup Language(XML) is emerging as a standard format of data representation and exchange on the Internet. There have been researches about storing and retrieving XML documents using the relational database which has techniques in full growth about large data processing, recovery, concurrency control and so on. Since in previous systems same structure information and fundamental operation are used for processing of various kinds of XML queries, only some specific query can be efficiently processed not all types of query. In this paper, we propose a flexible query processing system. To process query efficiently, the proposed system analyzes regular path expression queries, and uses ¥è-join operation using region numbering values to check ancestor-descendent relationship and equi-join operation using parent''s region start value to check parent-child relationship. Thus, the proposed system processes efficiently XML regular path expressions. From the experimental results, we show that proposed XML query processing system is more efficient than previous systems. |
Å°¿öµå(Keyword) |
Á¤±Ô °æ·Î½Ä
XML ÁúÀÇ Ã³¸®
XML-°ü°èÇü µ¥ÀÌŸº£À̽º ¸ÅÇÎ
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|