µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
Current Result Document : 1 / 1
ÇѱÛÁ¦¸ñ(Korean Title) |
Ŭ¶óÀ̾ðÆ®°¡ À̵¿Çϴ ȯ°æ¿¡¼ È¿À²ÀûÀÎ ¿¬¼Ó k-ÃÖ±ÙÁ¢ ÁúÀÇ Ã³¸®¸¦ À§ÇÑ »öÀÎ ±¸Á¶ |
¿µ¹®Á¦¸ñ(English Title) |
An Index Structure for Efficient k-NN Query Processing on the Moving Client Environments |
ÀúÀÚ(Author) |
¹Ú¿ëÈÆ
¼µ¿¹Î
À±Á¾Çö
½ÅÀç·æ
Ãֱ漺
À¯Àç¼ö
Yonghun Park
Dongmin Seo
Jonghyeon Yun
Jaeryong Shin
Kilsung Choi
Jaesoo Yoo
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 26 NO. 02 PP. 0077 ~ 0090 (2010. 08) |
Çѱ۳»¿ë (Korean Abstract) |
ÃÖ±Ù À§Ä¡ ÀÎ½Ä ±â¼ú°ú ÈÞ´ë ÀåÄ¡ÀÇ ¹ß´Þ·Î ÀÎÇØ À̵¿ÇÏ´Â °´Ã¼¸¦ ±â¹ÝÀ¸·Î ÇÏ´Â À§Ä¡ ±â¹Ý ¼ºñ½º(Location Based Service, LBS)ÀÇ °ü½ÉÀÌ Á¡Á¡ Áõ°¡ÇÏ°í ÀÖ°í ±×¿¡ °ü·ÃµÈ ¿¬±¸µéÀÌ È°¹ßÇÏ°Ô ÁøÇàµÇ°í ÀÖ´Ù. º» ³í¹®¿¡¼´Â °íÁ¤µÈ °´Ã¼¿Í À̵¿ÇÏ´Â ÁúÀÇ È¯°æ¿¡¼ ¿¬¼Ó k-ÃÖ±ÙÁ¢ ÁúÀǸ¦ È¿À²ÀûÀ¸·Î ¼öÇàÇÏ´Â »öÀÎ ±¸Á¶ÀÎ ISR-tree(Incremental Search R-tree)¸¦ Á¦¾ÈÇÑ´Ù. ÀÌ ±¸Á¶´Â ´Ü¸» ³ëµå¿¡¼ ÀÌ¿ô ³ëµåµéÀÇ Á¤º¸¸¦ À¯ÁöÇÏ¿© k-ÃÖ±ÙÁ¢ ÁúÀÇ Ã³¸®½Ã Áß°£ ³ëµå¿¡ ´ëÇÑ Å½»öȽ¼ö¸¦ °¨¼Ò½ÃÄ×À» »Ó¸¸ ¾Æ´Ï¶ó ¿¬¼Ó ÁúÀÇ Ã³¸®¸¦ À§ÇÑ ÁúÀÇ Àç¼öÇà½Ã Áß°£ ³ëµå¸¦ Ž»öÇÏÁö ¾Ê´Â´Ù. Á¦¾ÈÇÏ´Â ±â¹ýÀÇ ¿ì¼ö¼ºÀ» Æò°¡Çϱâ À§ÇØ R-tree¿ÍÀÇ ºñ±³¸¦ ¼öÇàÇÏ¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
The interest of Location-Based Services (LBS) has highly increased according to the development of location aware techniques and mobile devices and also the researches on LBS have been progressed in recent years. In this paper, we propose ISR-tree (Incremental Search R-tree) which processes continuous k-NN queries efficiently in the environment composed of static objects and moving clients submitting queries. In ISR-tree, the leaf-nodes maintain the entries of their neighbor nodes and the entries help to find the neighbor leaf-nodes without visiting internal nodes when k-NN queries are processed. As a result, ISR-tree saves the cost to visit internal nodes. We prove the superiority of ISR-tree through the comparison with previous works. |
Å°¿öµå(Keyword) |
À̵¿ °´Ã¼
À§Ä¡ ±â¹Ý ¼ºñ½º
k-ÃÖ±ÙÁ¢ ÁúÀÇ Ã³¸®
Moving Object
LBS(Location Based Service)
k-NN Query Processing
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|