• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > Çѱ¹Á¤º¸°úÇÐȸ Çмú´ëȸ > 2012³â Ãß°è Çмú´ëȸ

2012³â Ãß°è Çмú´ëȸ

Current Result Document : 17 / 17

ÇѱÛÁ¦¸ñ(Korean Title) Fastest Route Search for Large Scale Traffic-Data Graph on Giraph Using Bidirectional Dijkstra Algorithm with Potential Value Forecasting Awareness
¿µ¹®Á¦¸ñ(English Title) Fastest Route Search for Large Scale Traffic-Data Graph on Giraph Using Bidirectional Dijkstra Algorithm with Potential Value Forecasting Awareness
ÀúÀÚ(Author) ÄÚ½Ã¾Æ¿Ï ¿äÇϳ׽º   ±ÇÁØÈ£   È«ºÀÈñ   Yohanes Khosiawan   Joonho Kwon   Bonghee Hong  
¿ø¹®¼ö·Ïó(Citation) VOL 39 NO. 2(B) PP. 0064 ~ 0066 (2012. 11)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
 The traffic management issue on megapolitan regions keeps arising and demanding a more effective solution. Building more roads or highways is not a solution anymore; public transportation is becoming a later option since the increasing welfare of the citizens makes their prestige in having and using their own personal vehicles grater. With this condition, the traffic density on the roads is increasing dramatically, giving the equal dramatic increase to the amount of data needed to be processed. In this paper, we propose to use modified Bidirectional Dijkstra Algorithm for performing the fastest route search on Giraph framework, working seamlessly with HBase on Hadoop system.

Ű¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå