DMCA
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
| Citations: | 13 - 0 self |
BibTeX
@MISC{Rice_graphindexing,
author = {Michael Rice and Vassilis J. Tsotras},
title = {Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path query type in which dynamic constraints may be placed on the allowable set of edges that can appear on a valid shortest path (e.g., dynamically restricting the type of roads or modes of travel which may be considered in a multimodal transportation network). We formalize this problem as a specific variant of formal language constrained shortest path problems, which we call the Kleene Language Constrained Shortest Paths problem. To efficiently support this type of dynamically constrained shortest path query for large-scale datasets, we extend the hierarchical graph indexing technique known as Contraction Hierarchies. Our experimental evaluation using the North American road network dataset (with over 50 million edges) shows an average query speed and search space improvement of over 3 orders of magnitude compared to the naïve adaptation of the standard Dijkstra’s algorithm to support this query type. We also show an improvement of over 2 orders of magnitude compared to the only previously-existing indexing technique which could solve this problem without additional preprocessing. 1.
Keyphrases
road network shortest path label restriction graph indexing current widespread use gps technology shortest path problem kleene language specific variant experimental evaluation valid shortest path dynamic constraint na ve adaptation path query north american road network dataset hierarchical graph indexing technique average query speed location-based service formal language query type search space improvement path problem contraction hierarchy previously-existing indexing technique standard dijkstra algorithm large-scale datasets scalable shortest path query new shortest path query type multimodal transportation network additional preprocessing allowable set
