| Budget Amount *help |
¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
|
|---|
| Outline of Final Research Achievements |
In this study, we proposed fast algorithms to perform several kinds of queries in road network distances necessary in location based services (LBS). The basic operation in queries for LBS is the operation to search the road network distance between specified two points on the road network. This study proposed two fast algorithms; one is the single-source multi-target A* (SSMTA*) algorithm, and the other one is the simple materialized path view (SMPV). Especially, SMPV works on the pre-calculated distance data whose amount is only about five times larger than the adjacency list, and the performance is almost the same with conventional encoded path view methods. Applying those algorithms to RkNN query achieves several order of magnitude faster than the conventional algorithms. Furthermore, we proposed fast algorithms to solve the trip planning queries.
|
