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
id sg-ntu-dr.10356-63088
record_format dspace
spelling sg-ntu-dr.10356-630882023-03-03T20:47:42Z Optimal location queries on road networks Lip, Pin Han Xiao Xiao Kui School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity 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. Bachelor of Engineering (Computer Science) 2015-05-06T02:29:01Z 2015-05-06T02:29:01Z 2015 2015 Final Year Project (FYP) http://hdl.handle.net/10356/63088 en Nanyang Technological University 30 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
spellingShingle DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Lip, Pin Han
Optimal location queries on road networks
description 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.
author2 Xiao Xiao Kui
author_facet Xiao Xiao Kui
Lip, Pin Han
format Final Year Project
author Lip, Pin Han
author_sort Lip, Pin Han
title Optimal location queries on road networks
title_short Optimal location queries on road networks
title_full Optimal location queries on road networks
title_fullStr Optimal location queries on road networks
title_full_unstemmed Optimal location queries on road networks
title_sort optimal location queries on road networks
publishDate 2015
url http://hdl.handle.net/10356/63088
_version_ 1759854447297560576

Similar Items