Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)
ÇѱÛÁ¦¸ñ(Korean Title) |
À̵¿Ã¼ µ¥ÀÌÅͺ£À̽º¸¦ À§ÇÑ »öÀÎ ±¸Á¶ÀÇ ºñ¿ë¸ðµ¨ |
¿µ¹®Á¦¸ñ(English Title) |
Cost Model of Index Structures for Moving Objects Databases |
ÀúÀÚ(Author) |
ÀüºÀ±â
Bong-Gi Jun
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 11 NO. 03 PP. 0523 ~ 0531 (2007. 03) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â À̵¿Ã¼µéÀ» °ü¸®Çϱ⿡ ÀûÇÕÇÑ »õ·Î¿î »öÀÎ ±â¹ýÀ» °³¹ßÇÏ°í, ÀÌ ±â¹ýÀÇ ºñ¿ë ¸ðµ¨À» Á¦¾ÈÇÑ´Ù. ¶ÇÇÑ »ðÀÔ/»èÁ¦ ºñ¿ëÀÌ ÀûÀº µ¿Àû ÇØ½Ì »öÀÎÀ» Á¦¾ÈÇÑ´Ù. µ¿Àû ÇØ½Ì »öÀÎ ±¸Á¶´Â Çؽ¬¿Í Æ®¸®¸¦ °áÇÕÇÑ µ¿Àû ÇØ½Ì ±â¼úÀ» °ø°£ »öÀο¡ Àû¿ëÇÑ °ÍÀÌ´Ù. º» ³í¹®¿¡¼´Â À̵¿Ã¼ÀÇ ºó¹øÇÑ À§Ä¡ º¯°æ¿¡ ´ëÇÑ ºñ¿ë ¸ðµ¨°ú µ¿Àû »öÀÎ ±¸Á¶¸¦ ºÐ¼®ÇÏ¿´°í, ¼º´É Æò°¡ ½ÇÇèÀ» ÅëÇÏ¿© °ËÁõÇÏ¿´´Ù. ½ÇÇè °á°ú¿¡¼ »õ·ÎÀÌ Á¦¾ÈÇÏ´Â »öÀÎ ±â¹ý(µ¿Àû ÇØ½Ì »öÀÎ)Àº R-tree¿Í °íÁ¤ ±×¸®µå º¸´Ù ¼º´ÉÀÌ ¿ì¼öÇÏ¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
In this paper, we are going to develop a newly designed indexing scheme which is compatible to manage the moving objects and propose a cost model of the scheme. We propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. We analyzed the dynamic index structure and the cost model by the frequent position update of moving objects and verified through a performance assessment experiment. The results of our extensive experiments show that the newly proposed indexing schemes(Dynamic Hashing Index) are much more efficient than the traditional the fixed grid and R-tree. |
Å°¿öµå(Keyword) |
Moving objects databases
Geographic Information System
Spatio-temporal indexing
Hash
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|