µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
´ë¿ë·® ·Îµå³×Æ®¿öÅ©¿¡¼ È¿À²ÀûÀÎ ÇÁ¸®°Ö ±â¹ÝÀÇ ÃÖ´Ü°æ·Î »öÀÎ ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
Efficient Pregel based Shortest Path Indexing in Large Road Networks |
ÀúÀÚ(Author) |
±èÇö¿í
Hyunwook Kim
±èÅ¿¬
Taeyeon Kim
¹Ú±â¼º
Kisung Park
Çѿ뱸
Yongkoo Han
ÀÌ¿µ±¸
Young-Koo Lee
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 31 NO. 03 PP. 0083 ~ 0097 (2015. 12) |
Çѱ۳»¿ë (Korean Abstract) |
ÃÖ±Ù ´ë¿ë·®ÀÇ ·Îµå³×Æ®¿öÅ© µ¥ÀÌÅ͸¦ ÀÌ¿ëÇÏ¿© ´Ù¾çÇÑ À§Ä¡ ±â¹Ý ¼ºñ½º¸¦ Á¦°øÇÏ´Â ±â¼úÀÌ ³Î¸® È°¿ëµÇ°í ÀÖ´Ù. ÃÖ´Ü°æ·Î Ž»öÀº ·Îµå³×Æ®¿öÅ© µ¥ÀÌÅÍ¿¡¼ »ç¿ëÀÚ¿¡°Ô ÃÖÀûÀÇ À̵¿ °æ·Î µîÀ» Á¦°øÇÏ´Â °¡Àå ±âº»ÀûÀÎ ¿¬»êÀÌ´Ù. ±âÁ¸ÀÇ ÃÖ´Ü°æ·Î »öÀÎ ±â¹ýÀº ´ë¿ë·®ÀÇ ·Îµå³×Æ®¿öÅ©¿¡¼ ºñÈ¿À²ÀûÀÎ ¼öÇà½Ã°£°ú ¸Þ¸ð¸® °ø°£À» ¿ä±¸ÇÑ´Ù. ÃÖ±Ù ·Îµå³×Æ®¿öÅ© µ¥ÀÌÅ͸¦ ¿©·¯ °³ÀÇ µ¶¸³ÀûÀÎ ±×¸®µå ¼¿·Î ³ª´©°í, ±×¸®µå ³»ÀÇ Áß¿äÇÑ Áö¿ª¿¡ ´ëÇÏ¿© ÃÖ´Ü ¼¼±×¸ÕÆ®¸¦ »çÀü¿¡ ±¸ÃàÇÑ AH(arterial hierarchy)±â¹ýÀÌ Á¦¾ÈµÇ¾ú´Ù. AH´Â ÃÖ´Ü ¼¼±×¸ÕÆ®¸¦ ÀÌ¿ëÇÏ¿© °¢ ±×¸®µå ¼¿À» º´ÇÕÇϸç È¿À²ÀûÀ¸·Î ÃÖ´Ü°æ·Î¸¦ »öÀÎÇÑ´Ù. º» ³í¹®¿¡¼´Â ÇÁ¸®°Ö(pregel)À» ÀÌ¿ëÇÏ¿© ´ë¿ë·® ·Îµå³×Æ®¿öÅ©ÀÇ È¿À²ÀûÀÎ ÃÖ´Ü°æ·Î »öÀÎ ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ±â¹ýÀº ·Îµå³×Æ®¿öÅ©¸¦ ±×¸®µå ¼¿ ´ÜÀ§·Î ºÐÇÒÇÏ°í, ±×¸®µå ¼¿ ³»ÀÇ Áß¿ä ÁöÁ¡¿¡ ´ëÇÑ ÃÖ´Ü ¼¼±×¸ÕÆ® °è»êÀ» º´·Ä ó¸®ÇÑ´Ù. ¼º´ÉÆò°¡¸¦ ÅëÇÏ¿© Á¦¾ÈÇÏ´Â ±â¹ýÀÌ ±âÁ¸ÀÇ AHº¸´Ù ÃÖ´ë 75%ÀÇ ¼º´É Çâ»ó °á°ú¸¦ º¸ÀδÙ.
|
¿µ¹®³»¿ë (English Abstract) |
Recently, location based services using massive road network data are widely used. The shortest path indexing is an essential operation to provide an optimal moving path for users. The classic solution for the shortest path indexing requires inefficient running time and memory space for large road networks. Recently, Arterial Hierarchy(AH) has been proposed, which divides a road network into grid cells and pre-computes shortest segments for important points. AH efficiently construct indexes to the shortest path by combining the grid cells using the shortest segments. In this paper, we propose an efficient Pregel based shortest path indexing method for large road networks. The proposed method divides a road network into grid cells and performs distributed processing of shortest segments for important points in each cell. Our experimental results show that the proposed method can reduce running time for the shortest path indexing by up to 75% compared with the existing AH.
|
Å°¿öµå(Keyword) |
ÃÖ´Ü°æ·Î »öÀÎ ±â¹ý
ÇÁ¸®°Ö ÇÁ·¹ÀÓ¿öÅ©
´ë¿ë·® ·Îµå³×Æ®¿öÅ©
shortest path indexing
Pregel framework
large road networks
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|