Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
ÇѱÛÁ¦¸ñ(Korean Title) |
°æ·Î ¸ÅĪ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ ±¸Á¶ÈµÈ ¹®¼ÀÇ º¯È ŽÁö |
¿µ¹®Á¦¸ñ(English Title) |
Change Detection of Structured Documents using Path-Matching Algorithm |
ÀúÀÚ(Author) |
ÀÌ°æÈ£
º¯Ã¢¿ø
̅˱̦
°í°ß
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 28 NO. 04 PP. 0606 ~ 0619 (2001. 12) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â SGML/XML ¹®¼ÀÇ ±¸ ¹öÀü°ú ½Å ¹öÀü°£ÀÇ Â÷À̸¦ °è»êÇÒ ¼ö ÀÖ´Â È¿À²ÀûÀÎ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Â÷ÀÌ´Â ±¸ ¹öÀüÀÇ ¹®¼¸¦ ½Å ¹öÀüÀ¸·Î º¯È¯Çϴµ¥ ¼Ò¿äµÇ´Â ÆíÁý ½ºÅ©¸³Æ®·Î °£ÁÖÇÒ ¼ö ÀÖ´Ù. Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀº »óÇâ½Ä°ú ÇÏÇâ½ÄÀÇ º¹ÇÕÀûÀÎ Á¢±Ù ¹æ½ÄÀ» Àû¿ëÇÑ´Ù. ¸ÕÀú µÎ ¹öÀüÀ» ±¸¼ºÇÏ´Â ³ëµå°£ÀÇ ´ëÀÀ°ü°è¸¦ »óÇâ½ÄÀ¸·Î »ý¼ºÇϸç ÇÏÇâ½Ä ³Êºñ ¿ì¼± Ž»öÀ» Àû¿ëÇÏ¿© ÆíÁý ½ºÅ©¸³Æ®¸¦ °è»êÇÑ´Ù. Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀº ¸ðµç ³ëµå°£ÀÇ ´ëÀÀ ¿©ºÎ¸¦ ¸ðµÎ Á¶»çÇÒ ÇÊ¿ä°¡ ¾ø±â ¶§¹®¿¡ ´ëÀÀ°ü°è¸¦ º¸´Ù ºü¸£°Ô »ý¼ºÇÒ ¼ö ÀÖ´Ù. ¶ÇÇÑ »ðÀÔ, »èÁ¦, ±×¸®°í °»½ÅÀÇ ´Ü¼øÇÑ º¯È´Â ¹°·ÐÀÌ°í ºÎÆ®¸® À̵¿°ú º¹»çÀÇ ±¸Á¶ÀûÀ¸·Î º¸´Ù ÀÇ¹Ì ÀÖ´Â º¯È¸¦ ŽÁöÇÒ ¼ö ÀÖ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
This paper presents an efficient algorithm to compute differences between old and new versions of an SGML/XML document. The difference between the two versions can be considered to be an edit script that transforms one document tree into another. The proposed algorithm is based on hybridization of bottom-up and top-down methods: matching relationships between nodes in the two versions are produced in a bottom-up manner and top-down breadth-first search computes an edit script. Because the algorithm does not need to investigate possible existence of matchings for all nodes, faster matching can be achieved. Furthermore, it can detect more structurally meaningful changes such as subtree move and copy as well as simple changes to the node itself like insert, delete, and update. |
Å°¿öµå(Keyword) |
SGML
XML
³ëµå
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|