Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
½Ã¾ß°¢À¸·Î ÇÑÁ¤µÈ ÃÖ±ÙÁ¢ ÁúÀÇ |
¿µ¹®Á¦¸ñ(English Title) |
View Field Nearest Neighbor Queries |
ÀúÀÚ(Author) |
À̼º¹Î
Á¤¿¬µ·
¹ÚÁØÇ¥
Á¤Çϸ²
Sungmin Yi
Yon Dohn Chung
Jun Pyo Park
HaRim Jung
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 18 NO. 01 PP. 0075 ~ 0079 (2012. 01) |
Çѱ۳»¿ë (Korean Abstract) |
ÃÖ±Ù ¸¹Àº °ü½ÉÀ» ¹Þ°í ÀÖ´Â Áõ°Çö½Ç À§Ä¡±â¹Ý ¼ºñ½º¿Í °°ÀÌ »ç¿ëÀÚÀÇ ÇÑÁ¤µÈ ½Ã¾ß°¢ÀÌ Á¸ÀçÇÏ´Â »óȲ¿¡¼ »ç¿ëÀÚ°¡ ¿øÇÏ´Â µ¥ÀÌÅ͸¦ È¿°úÀûÀ¸·Î Á¦°øÇϱâ À§ÇÏ¿© º» ³í¹®¿¡¼´Â »õ·Î¿î À§Ä¡±â¹Ý ÁúÀÇÀÎ ½Ã¾ß ÃÖ±ÙÁ¢ ÁúÀÇ (VFNN: View Field Nearest Neighbor Query)¸¦ ¼Ò°³ÇÑ´Ù. VFNN ÁúÀÇ´Â »ç¿ëÀÚÀÇ ½Ã¾ß°¢ ¶Ç´Â ÇÑÁ¤µÈ °¢³»¿¡ À§Ä¡ÇÏ´Â °¡Àå °¡±î¿î µ¥ÀÌÅ͸¦ °Ë»öÇÑ´Ù. º» ³í¹®¿¡¼ Á¦¾ÈÇÏ´Â VFNN ÁúÀÇ Ã³¸® ¾Ë°í¸®ÁòÀº °¡Àå ³Î¸® È°¿ëµÇ°í ÀÖ´Â °ø°£ µ¥ÀÌÅÍ »öÀÎ ±¸Á¶ÀÎ R*-tree¸¦ »ç¿ëÇÑ´Ù. ƯÈ÷, ÁúÀÇ Á¡°ú MBR »çÀÌÀÇ ÃּҰŸ®ÀÎ MINDIST»Ó¸¸ ¾Æ´Ï¶ó, ÁúÀÇ Á¡°ú MBR »çÀÌÀÇ ÃÖ´ë °¢, ÃÖ¼Ò °¢À» Á¤ÀÇÇÑ´Ù. À̸¦ È°¿ëÇÏ¿© R*-tree Ž»ö ½Ã ÁúÀÇ °á°ú °ªÀ» Æ÷ÇÔÇÏÁö ¾Ê´Â ³ëµåµéÀ» ¿¬»ê¿¡¼ Á¦¿ÜÇÏ¿© ÁúÀÇ Ã³¸®ÀÇ È¿À²¼ºÀ» Çâ»ó½ÃŲ´Ù. ¸¶Áö¸·À¸·Î ½ÇÇèÀ» ÅëÇÏ¿© VFNN ÁúÀÇ Ã³¸® ¾Ë°í¸®ÁòÀÇ ¼º´ÉÀ» Æò°¡ÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In many location based services with augmented reality, it is critical to provide valuable data to users of diverse interests based on their locations as well as their view-fields. This paper introduces a novel type of spatial queries, which we call the View Field Nearest Neighbor (VFNN) query. Given a user's view-field, VFNN finds the nearest data object that falls within the users' view-field. In this paper, we utilize the R*-tree, one of the most representative index structures, to index spatial data objects and search VFNN in an efficient manner. In particular, we employ (i) MINDIST to compute the minimum possible distance from a query point (i.e., user's location) to each data object and (ii) min_angle (max_angle), which is the starting (ending) angle in the user's view-field boundary, for pruning unnecessary search paths in the R*-tree. Finally, we conduct the simulation experiments to investigate the performance of the proposed VFNN search algorithm.
|
Å°¿öµå(Keyword) |
À§Ä¡±â¹Ý ¼ºñ½º
°ø°£ µ¥ÀÌÅÍ
ÃÖ±ÙÁ¢ ÁúÀÇ
Áõ°Çö½Ç
Location-based service
Spatial data
Nearest neighbor queries
Augmented reality
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|