Constrained Shortest Path Computation

Constrained Shortest Path Computation

Cached

Download Links

by Manolis Terrovitis , Spiridon Bakiras , Dimitris Papadias , Kyriakos Mouratidis

Citations:

3 - 0 self

Versions

Version History

Metadata Version 1

User correction supplied by mph

Datum	Value	Source
TITLE	Constrained Shortest Path Computation	user correction
AUTHOR NAME	Manolis Terrovitis	user correction
AUTHOR AFFIL	1 Electrical and Computer Engineering Department, National Technical University of Athens,	user correction
AUTHOR ADDR	Greece,	user correction
AUTHOR NAME	Spiridon Bakiras	user correction
AUTHOR AFFIL	2 Computer Science Department, Hong Kong University of Science and Technology	user correction
AUTHOR ADDR	Clear; Water Bay, Hong Kong,	user correction
AUTHOR NAME	Dimitris Papadias	user correction
AUTHOR AFFIL	2 Computer Science Department, Hong Kong University of Science and Technology	user correction
AUTHOR ADDR	Clear; Water Bay, Hong Kong,	user correction
AUTHOR NAME	Kyriakos Mouratidis	user correction
AUTHOR AFFIL	2 Computer Science Department, Hong Kong University of Science and Technology	user correction
AUTHOR ADDR	Clear; Water Bay, Hong Kong,	user correction
ABSTRACT	This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, anaautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. Ak-stops query retrieves a sequence that contains exactly k intermediate data points. In both cases our aim is to compute the shortest path subject to these constraints. Assuming that the dataset is indexed by a data-partitioning method, the proposed techniques initially compute a sub-optimal path by utilizing the Euclidean distance information provided by the index. The length of the retrieved path is used to prune the search space, filtering out large parts of the input dataset. In a final step, the optimal (a-autonomy or k-stops) path is computed (using only the non-eliminated data points) by an exact algorithm. We discuss several processing methods for both problems, and evaluate their efficiency through extensive experiments.	user correction
CITATIONS	23 found	ParsCit 1.0