Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
°ø°£ ³×Æ®¿öÅ© µ¥ÀÌŸº£À̽º¿¡¼ ½Ã°£Á¦¾àÀ» °í·ÁÇÑ °æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇó¸® ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
In-Route Nearest Neighbor Query Processing Algorithm with Time Constraint in Spatial Network Databases |
ÀúÀÚ(Author) |
±è¿ë±â
±è»ó¹Ì
ÀåÀç¿ì
Yongki Kim
Sangmi Kim
Jaewoo Chang
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 14 NO. 02 PP. 0196 ~ 0200 (2008. 04) |
Çѱ۳»¿ë (Korean Abstract) |
ÃÖ±Ù °ø°£ ³×Æ®¿öÅ© µ¥ÀÌŸº£À̽º¸¦ À§ÇÑ ÁúÀÇó¸® ¾Ë°í¸®Áò¿¡ °üÇÑ ¿¬±¸°¡ ¸¹ÀÌ ÁøÇàµÇ¾î ¿ÔÀ¸³ª, °æ·Î-±â¹Ý ÁúÀÇ¿¡ ´ëÇÑ ¿¬±¸´Â ¸Å¿ì ¹ÌÈíÇÑ ½ÇÁ¤ÀÌ´Ù. °ø°£ ³×Æ®¿öÅ© µ¥ÀÌŸº£À̽º¿¡¼´Â À̵¿°´Ã¼°¡ °ø°£ ³×Æ®¿öÅ©»ó¿¡¼¸¸ À̵¿Çϱ⠶§¹®¿¡ LBS(Location-Based Services) ¹× Telematic¿Í °°Àº ÀÀ¿ë¿¡¼´Â °æ·Î-±â¹Ý ÁúÀÇ°¡ ¸Å¿ì À¯¿ëÇÏ°Ô »ç¿ëµÈ´Ù. µû¶ó¼ º» ³í¹®¿¡¼´Â °æ·Î-±â¹Ý ÁúÀÇÀÇ ´ëÇ¥ÀûÀÎ ¹æ¹ýÀÎ °æ·Î ³» ÃÖ±ÙÁ¢(In-Route Nearest Neighbor, IRNN) ÁúÀÇó¸® ¾Ë°í¸®ÁòÀ» ºÐ¼®ÇÏ°í, ½Ã°£ Á¦¾àÀ» Áö´Ñ »õ·Î¿î °æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇó¸® ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ¾Æ¿ï·¯, ¼º´É ºÐ¼®À» ÅëÇÏ¿© ½Ã°£ Á¦¾àÀ» Áö´Ñ Á¦¾ÈÇÏ´Â ÁúÀÇó¸® ¾Ë°í¸®ÁòÀÌ ±âÁ¸ °æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇó¸® ¾Ë°í¸®Áò¿¡ ºñÇÏ¿© °Ë»ö ¼º´ÉÀÌ ¿ì¼öÇÔÀ» º¸ÀδÙ. |
¿µ¹®³»¿ë (English Abstract) |
Recently, the query processing algorithm in spatial network database (SNDB) has attracted many interests. However, there is little research on route-based query processing algorithm in SNDB. Since the moving objects moves only in spatial networks, the route-based algorithm is very useful for LBS and Telematics applications. In this paper, we analyze In-Route Nearest Neighbor (IRNN) query, which is an typical one of route- based queries, and propose a new IRNN query processing algorithm with time constraint. In addition, we show from our performance analysis that our IRNN query processing algorithm with time constraint is better on retrieval performance than the existing IRNN query processing one. |
Å°¿öµå(Keyword) |
°ø°£ ³×Æ®¿öÅ©µ¥ÀÌŸº£À̽º
ÁúÀÇó¸® ¾Ë°í¸®Áò
°æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇ
Spatial network database
Query processing algorithm
In-Route Nearest Neighbor query
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|