Optimal location queries on road networks

• المؤلف الرئيسي: Lip, Pin Han
• مؤلفون آخرون: Xiao Xiao Kui
• التنسيق: Final Year Project
• اللغة: English
• منشور في: 2015
• الموضوعات: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• الوصول للمادة أونلاين: http://hdl.handle.net/10356/63088
• المؤسسة: Nanyang Technological University

Shortest path search are a popular topic due to the increasingly use of navigation products and social networks. A research paper, “Robust Exact Distance Queries on Massive Networks”, aims to provide a new solution for how to achieve shortest path search query quickly. This report looks at how pre-processing algorithms can help to accelerate the query process and how SamPG algorithm is able to query in large networks and yet minimising the resources required to do so. In addition, we will compare it with similar algorithms previously developed and to determine their performance in pre-processing datasets.