µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
Current Result Document : 6 / 6
ÇѱÛÁ¦¸ñ(Korean Title) |
¹«¼± ¹æ¼Û ½ºÆ®¸²¿¡¼ À§Ä¡±â¹Ý »óÀ§-k ÁúÀÇ |
¿µ¹®Á¦¸ñ(English Title) |
Location Based Top-k Query Processing on Wireless Broadcast Streams |
ÀúÀÚ(Author) |
Á¤Çϸ²
Á¶º´±¸
Á¤¿¬µ·
HaRim Jung
ByungKu Cho
Yon Dohn Chung
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 25 NO. 03 PP. 0077 ~ 0094 (2009. 12) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®Àº ¹«¼± µ¥ÀÌÅÍ ¹æ¼Û ½Ã½ºÅÛ¿¡¼ µ¥ÀÌÅÍÀÇ °ø°£ ¼Ó¼º»Ó¸¸ ¾Æ´Ï¶ó ºñ°ø°£ ¼Ó¼ºÀ» È°¿ëÇÏ¿© À̵¿ »ç¿ëÀÚ°¡ ¼±È£ÇÏ´Â µ¥ÀÌÅ͸¦ È¿°úÀûÀ¸·Î °Ë»öÇÒ ¼ö ÀÖ°Ô ÇÏ´Â »õ·Î¿î À§Ä¡±â¹Ý ÁúÀÇÀÎ À§Ä¡±â¹Ý »óÀ§-k ÁúÀǸ¦ Á¤ÀÇÇÏ°í, ¹«¼±¹æ¼Û ½ºÆ®¸²¿¡¼ À§Ä¡±â¹Ý »óÀ§-k ÁúÀǸ¦ ¼öÇàÇϱâ À§ÇÑ µÎ °¡Áö ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. ù ¹ø° ±â¹ýÀº ¹æ¼Û µ¥ÀÌÅÍÀÇ °ø°£¡¤ºñ°ø°£ ¼Ó¼ºÀ» ±â¹ÝÀ¸·Î R-treeÀÇ º¯ÇüÀÎ aggregate R-tree (aR-tree)¸¦ ±¸ÃàÇÏ°í ¹æ¼Û ½ºÆ®¸²¿¡ ¹èÄ¡ÇÑ´Ù. ÇÏÁö¸¸ aR-tree´Â À§Ä¡±â¹Ý »óÀ§-k ÁúÀÇ ¼öÇà ½Ã Æ©´×½Ã°£ ¼º´ÉÀ» ÇöÀúÈ÷ ÀúÇϽÃų ¼ö ÀÖ´Ù. À̸¦ ÇØ°áÇϱâ À§ÇÑ µÎ ¹ø° ±â¹ýÀº bit-vector R-tree (bR-tree)¸¦ È°¿ëÇÏ¿© À§Ä¡±â¹Ý »óÀ§-k ÁúÀǸ¦ ¼öÇàÇÑ´Ù. ¼º´ÉÆò°¡¸¦ ÅëÇØ bRtree ±â¹ýÀÌ aR-tree ±â¹ÝÀÇ ´Ü¼øÇÑ ±â¹ý¿¡ ºñÇØ Æ©´× ½Ã°£ Ãø¸é¿¡¼ ¸Å¿ì ¿ì¼öÇÒ »Ó¸¸ ¾Æ´Ï¶ó ´õ ³ªÀº Á¢±Ù ½Ã°£ ¼º´ÉÀ» º¸ÀÓÀ» È®ÀÎÇÏ¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
This paper explores the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial specification for the data objects in the wireless data broadcasting system. The location based top-k query, issued by a mobile user, aims to retrieve the k data objects that best match the user¡¯s specification on the spatial and the non-spatial attributes of data objects. We present two methods for the processing of location based top-k queries on the wireless broadcast stream. The first method makes use of the aggregate R-tree (aR-tree), a variant of the R-tree. Although the aR-tree can be used for processing location based top-k queries on the broadcast stream, it may deteriorate the search performance, especially in terms of the tuning time. With this problem in mind, we propose a novel R-tree variant index structure, called the bit-vector R-tree (bR-tree) to facilitate processing of location based top-k queries on the broadcast stream. The search algorithm on the broadcast bR-tree is also discussed. Our simulation experiments demonstrate that the bR-tree method significantly outperforms the aR-tree-based naive method in terms of the tuning time, while maintaining similar or better performance in terms of the access time. |
Å°¿öµå(Keyword) |
¹«¼± µ¥ÀÌÅÍ ¹æ¼Û ½Ã½ºÅÛ
À§Ä¡±â¹Ý ¼ºñ½º
À§Ä¡±â¹Ý »óÀ§-k ÁúÀÇ
Wireless data broadcasting system
Location based services
Location based top-k query
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|