Graph Theory, 1736-1936
Introduction to algorithms
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Finding shortest paths in large network systems
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
IEEE Transactions on Knowledge and Data Engineering
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Constrained shortest path computation
SSTD'05 Proceedings of the 9th 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
Processing transitive nearest-neighbor queries in multi-channel access environments
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The multi-rule partial sequenced route query
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Route Search over Probabilistic Geospatial Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
An interactive approach to route search
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Multi-type nearest neighbor queries in road networks with time window constraints
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Best point detour query in road networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Interactive route search in the presence of order constraints
Proceedings of the VLDB Endowment
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
Multi-approximate-keyword routing in GIS data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
TARSIUS: a system for traffic-aware route search under conditions of uncertainty
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
WISER: a web-based interactive route search system for smartphones
Proceedings of the 21st international conference companion on World Wide Web
Keyword-aware optimal route search
Proceedings of the VLDB Endowment
Sequenced route queries: getting things done on the way back home
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Interactive traffic-aware route search on smartphones
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Maximizing the number of worker's self-selected tasks in spatial crowdsourcing
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Group trip planning queries in spatial databases
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
Real-world road-planning applications often result in the formulation of new variations of the nearest neighbor (NN) problem requiring new solutions. In this paper, we study an unexplored form of NN queries named optimal sequenced route (OSR) query in both vector and metric spaces. OSR strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a particular order imposed on the types of the locations. We first transform the OSR problem into a shortest path problem on a large planar graph. We show that a classic shortest path algorithm such as Dijkstra's is impractical for most real-world scenarios. Therefore, we propose LORD, a light threshold-based iterative algorithm, which utilizes various thresholds to prune the locations that cannot belong to the optimal route. Then we propose R-LORD, an extension of LORD which uses R-tree to examine the threshold values more efficiently. Finally, for applications that cannot tolerate the Euclidean distance as estimation and require exact distance measures in metric spaces (e.g., road networks) we propose PNE that progressively issues NN queries on different point types to construct the optimal route for the OSR query. Our extensive experiments on both real-world and synthetic datasets verify that our algorithms significantly outperform a disk-based variation of the Dijkstra approach in terms of processing time (up to two orders of magnitude) and required workspace (up to 90% reduction on average).