ÇѱÛÁ¦¸ñ(Korean Title) |
°ø°£ ³×Æ®¿öÅ© µ¥ÀÌÅͺ£À̽º¿¡¼ °ø°£ Á¦¾àÀ» °í·ÁÇÑ °æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇó¸® ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
In-Route Nearest Neighbor Query Processing Algorithm with Space-constraint in Spatial Network Databases |
ÀúÀÚ(Author) |
±è¿ë±â
Yong-Ki Kim
±è¾Æ¸§
Ah-Reum Kim
ÀåÀç¿ì
Jae-Woo Chang
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 10 NO. 03 PP. 0019 ~ 0030 (2008. 09) |
Çѱ۳»¿ë (Korean Abstract) |
ÃÖ±Ù °ø°£ ³×Æ®¿öÅ© µ¥ÀÌÅͺ£À̽º¸¦ À§ÇÑ ÁúÀÇó¸® ¾Ë°í¸®Áò¿¡ °üÇÑ ¿¬±¸°¡ ¸¹Àº °ü½ÉÀ» ¹Þ°í ÀÖÀ¸³ª, °æ·Î-±â¹Ý ÁúÀÇ¿¡ ´ëÇÑ ¿¬±¸´Â ¸Å¿ì ¹ÌÈíÇÑ ½ÇÁ¤ÀÌ´Ù. °ø°£ ³×Æ®¿öÅ© µ¥ÀÌÅͺ£À̽º¿¡¼´Â À̵¿°´Ã¼°¡ °ø°£ ³×Æ®¿öÅ©»ó¿¡¼¸¸ À̵¿Çϱ⠶§¹®¿¡, À§Ä¡±â¹Ý ¼ºñ½º ¹× ÅÚ·¹¸Åƽ½ºÀÇ ÀÀ¿ëÀ» Áö¿øÇϱâ À§ÇØ °æ·Î ³» ÃÖ±ÙÁ¢(In-Route Nearest Neighbor: IRNN) ÁúÀÇ¿Í °°Àº °æ·Î-±â¹Ý ÁúÀÇ¿¡ ´ëÇÑ È¿À²ÀûÀÎ ÁúÀÇó¸® ¾Ë°í¸®Áò ¿¬±¸°¡ ÇʼöÀûÀÌ´Ù. ±×·¯³ª ±âÁ¸ °æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇó¸® ¾Ë°í¸®ÁòÀº µµ·Î³»ÀÇ º´¸ñÇö»óÀ» ¹Ý¿µÇÏÁö ¸øÇÏ´Â ¹®Á¦Á¡ÀÌ Á¸ÀçÇÑ´Ù. µû¶ó¼ º» ³í¹®¿¡¼´Â °ø°£Á¦¾àÀ» °í·ÁÇÑ °æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇó¸® ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ¸¶Áö¸·À¸·Î, ±âÁ¸ ¾Ë°í¸®Áò°úÀÇ ¼º´É ºñ±³¸¦ ÅëÇÏ¿© Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀÌ ¿ì¼öÇÔÀ» º¸ÀδÙ.
|
¿µ¹®³»¿ë (English Abstract) |
Recently, the query processing algorithm in the field of spatial network database(SNDB) has been attracted by many interests. But, there is little research on route-based queries. Since the moving objects move only in spatial networks, the efficient route-based query processing algorithms, like in-route nearest neighbor(IRNN), are essential for Location-based Service(LBS) and Telematics application. However, the existing IRNN query processing algorithm has a problem that it does not consider traffic jams in the road network. In this thesis, we propose an IRNN query processing algorithm which considers space restriction. Finally, we show that space-constrained IRNN query processing algorithm is efficient compared with the existing IRNN algorithm.
|
Å°¿öµå(Keyword) |
°ø°£ ³×Æ®¿öÅ© µ¥ÀÌÅͺ£À̽º
ÁúÀÇó¸® ¾Ë°í¸®Áò
°æ·Î ³» ÃÖ±ÙÁ¢ ÁúÀÇ
Spatial network database
query processing algorithm
in-route nearest neighbor query
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|