Optimal location queries on road networks

Optimal location queries on road networks

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-p...

Full description

Saved in:
Bibliographic Details
Main Author: Lip, Pin Han
Other Authors: Xiao Xiao Kui
Format: Final Year Project
Language:English
Published: 2015
Subjects:
DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Online Access:http://hdl.handle.net/10356/63088
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary: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.

Similar Items