Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Current Result Document : 10 / 11
ÇѱÛÁ¦¸ñ(Korean Title) |
µ¿Àû hilbert Curve »öÀÎÀ» ÀÌ¿ëÇÑ È¿À²ÀûÀÎ k-NN ÁúÀÇ Ã³¸® |
¿µ¹®Á¦¸ñ(English Title) |
Efficient k-NN Query Processing using Dynamic Hilbert Curve Index |
ÀúÀÚ(Author) |
¼µ¿¹Î
À̽¿ì
±è Æò
Á¤ÇѹÎ
¹Ú¿ëÈÆ
À¯Àç¼ö
Dongmin Seo
Seungwoo Lee
Pyung Kim
Hanmin Jung
Yonghun Park
Jaesoo Yoo
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 38 NO. 01 PP. 0036 ~ 0041 (2011. 02) |
Çѱ۳»¿ë (Korean Abstract) |
À̵¿°´Ã¼ µ¥ÀÌÅͺ£À̽º ºÐ¾ß¿¡¼ À̵¿°´Ã¼ÀÇ À§Ä¡ º¯°æ¿¡ ´ëÇÑ ´ë·®ÀÇ °»½Å ¿¬»êÀ» ºü¸£°Ô ó¸®ÇÏ¸é¼ µ¿½Ã¿¡ ´ë·®ÀÇ ÁúÀǸ¦ È¿°úÀûÀ¸·Î ó¸®ÇÒ ¼ö ÀÖ´Â À̵¿°´Ã¼ »öÀο¡ ´ëÇÑ ¿¬±¸°¡ ÁøÇàµÇ°í ÀÖ´Ù. ÃÖ±Ù, R-Æ®¸® ±â¹ÝÀÇ À̵¿°´Ã¼ »öÀÎÀÌ °¡Áö´Â °»½Å ÀúÇÏ ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇØ, Hilbert curve¸¦ »ç¿ëÇÏ´Â B+-Æ®¸® ±â¹ÝÀÇ ST©÷B-Æ®¸®°¡ Á¦¾ÈµÇ¾ú´Ù. ÇÏÁö¸¸ ST©÷B-Æ®¸®ÀÇ Hilbert curve´Â ¹Ý°íÁ¤µÈ ÇØ»óµµ(¶Ç´Â Â÷¼ö, order)¸¦ »ç¿ëÇϱ⠶§¹®¿¡ À̵¿°´Ã¼°¡ ºÒ±Õµî ºÐÆ÷µÇ¸é °Ë»ö ¼º´ÉÀÌ ÇöÀúÈ÷ °¨¼ÒÇÏ´Â ¹®Á¦¸¦ °¡Áø´Ù. ±×·¡¼ º» ³í¹®ÀÇ ÀúÀÚµéÀº Hilbert curveÀÇ Çػ󵵸¦ °´Ã¼ÀÇ ºÐÆ÷¿Í °³¼ö¿¡ µû¶ó °¡º¯ÀûÀ¸·Î Àû¿ëÇÏ´Â ¹æ¹ýÀ» Á¦¾ÈÇß´Ù. ÇÏÁö¸¸, ST©÷B-tree¿Í Á¦¾ÈÇÑ »öÀÎÀÇ k-NN ¾Ë°í¸®ÁòÀº ºÒÇÊ¿äÇÑ ÆäÀÌÁö Á¢±ÙÀÌ ¹ß»ýÇÑ´Ù. µû¶ó¼ º» ³í¹®¿¡¼´Â k-NN ÁúÀÇ Ã³¸® ¼º´ÉÀ» Çâ»ó½Ãų ¼ö ÀÖ´Â Çâ»óµÈ k-NN ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ¶ÇÇÑ, ½ÇÇèÀ» ÅëÇؼ Á¦¾ÈÇÏ´Â ±â¹ýÀÌ ST©÷B-tree¿¡ ºñÇØ Çâ»óµÇ¾úÀ½À» º¸ÀδÙ.
|
¿µ¹®³»¿ë (English Abstract) |
In the field of a moving object database, studies on moving object indexes have been progressed. Moving object indexes handle frequent updates of object's locations and many queries of users efficiently. To solve a lowering of the update performance of moving object indexes based on R-tree, ST2B-tree that uses the Hilbert curve and is based on B -tree is proposed recently. However, if moving objects are skewed, the update performance of ST2B-tree has a rapid decline because the Hilbert curve of ST2B-tree has a semi-fixed order. Therefore, we proposed an advanced Hilbert curve that adjusts automatically the order of Hilbert curve according to the data distribution and the number of moving objects. However, k-NN algorithms of ST2B-tree and our index have a lot of unnecessary page accesses. In this paper, we propose an advanced k-NN algorithm to improve the k-NN performance. We show that our algorithm is better than ST2B-tree by experiments.
|
Å°¿öµå(Keyword) |
k-NN
Hilbert Curve
»öÀÎ
À̵¿°´Ã¼
À§Ä¡±â¹Ý ¼ºñ½º
Index
Moving Object
Location-based Service
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|