Multi-type nearest neighbor queries in road networks with time window constraints

Authors:
Xiaobin Ma;Shashi Shekhar;Hui Xiong
Affiliations:
Teradata Corporation;University of Minnesota;Rutgers University
Venue:
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Year:
2009

Citing 8
Cited 1

Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
Exploiting a page-level upper bound for multi-type nearest neighbor queries

GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Finding time-dependent shortest paths over large graphs

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The optimal sequenced route query

The VLDB Journal — The International Journal on Very Large Data Bases
Processing Optimal Sequenced Route Queries Using Voronoi Diagrams

Geoinformatica
Spatio-temporal network databases and routing algorithms: a summary of results

SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
On trip planning queries in spatial databases

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases

On multi-type reverse nearest neighbor search

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a study of Multi-type Nearest Neighbor (MTNN) Queries in road networks with time window constraints. Specifically, we provide a label correcting algorithm, which is based on a time aggregated multi-type graph. This algorithm gives the best start time, a turn-by-turn route, and the shortest path in terms of least travel time for a given MTNN query.