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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)

Current Result Document : 66 / 397 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) ÇöÀç¿Í °ú°Å À§Ä¡ ÁúÀǸ¦ À§ÇÑ ½Ã°ø°£ »öÀο¡ °üÇÑ ¿¬±¸
¿µ¹®Á¦¸ñ(English Title) A Study on Spatial-temporal indexing for querying current and past positions
ÀúÀÚ(Author) ÀüºÀ±â   Bong-Gi Jun  
¿ø¹®¼ö·Ïó(Citation) VOL 08 NO. 06 PP. 1250 ~ 1256 (2004. 10)
Çѱ۳»¿ë
(Korean Abstract)
ÇöÀç ¹× °ú°Å À§Ä¡ ÁúÀǸ¦ À§ÇØ ¿¬¼ÓÀûÀ¸·Î º¯°æµÇ´Â À§Ä¡ÀÇ À̵¿Àº ÀúÀåµÇ°í »öÀÎÈ­ µÇ¾î¾ß ÇÑ´Ù. ±âÁ¸ÀÇ R-Æ®¸®¿¡ ½Ã°£À» ´Ù¸¥ Â÷¿øÀ¸·Î Ãß°¡ÇÏ¿© °£´ÜÇÏ°Ô È®ÀåÇÑ 3Â÷¿ø R-Æ®¸®´Â ÇöÀç À§Ä¡ ÁúÀǸ¦ ´Ù·çÁö ¾Ê°í ÀÖÀ¸¸ç, »öÀÎ ³ëµåµéÀÇ ¸¹Àº ÁßøÀ¸·Î ÀÎÇÏ¿© °ø°£ È°¿ëµµ°¡ ³·´Ù´Â ¹®Á¦Á¡ÀÌ ÀÖ´Ù. ÀÌ ³í¹®¿¡¼­´Â ºÐÇÒµÈ ³ëµåÀÇ °ø°£ È°¿ëµµ¸¦ ³ôÀ̱â À§ÇÏ¿© Çâ»óµÈ 3Â÷¿ø R-Æ®¸®ÀÇ µ¿Àû ºÐÇÒ Á¤Ã¥À» Á¦¾ÈÇÑ´Ù. ¶ÇÇÑ, À̵¿Ã¼µéÀÇ ÇöÀç ¹× °ú°Å À§Ä¡¸¦ ÁúÀÇÇϱâ À§ÇØ »õ·Î¿î ÅÂ±× »öÀÎ ±¸Á¶¸¦ ¼Ò°³ÇÔÀ¸·Î¼­ ±âÁ¸ÀÇ 3Â÷¿ø R-Æ®¸®¸¦ È®ÀåÇÏ¿´´Ù. ÇöÀç ¹× °ú°Å À§Ä¡ ÁúÀÇ¿¡¼­ Á¦¾ÈÇÏ´Â ÅÂ±× µ¿Àû 3Â÷¿ø R-Æ®¸®´Â ±âÁ¸ÀÇ 3Â÷¿ø R-Æ®¸®¿Í TB-Æ®¸® º¸´Ù ¼º´ÉÀÌ ¿ì¼öÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.
Å°¿öµå(Keyword) Moving objects databases   Spatio-temporal indexing   R-tree   Splitting policies  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå