The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
The multi-rule partial sequenced route query
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Heuristic algorithms for route-search queries over geographical data
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Computing a k-route over uncertain geographical data
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
In-Route skyline querying for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
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
Interactive route search in the presence of order constraints
Proceedings of the VLDB Endowment
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
Interactive traffic-aware route search on smartphones
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Probabilistic parking queries using aging functions
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
In a probabilistic route search, there is a start location, a target location, and search queries Q1, ..., Qn. Each Qi has an answer set Ai consisting of geo-spatial objects and their probabilities. The probability of an object o ∈ Ai specifies the likelihood that o satisfies Qi. The goal is to compute a route that is short and yet has a high probability of satisfying all the Qi. This paper investigates interactive route search. Upon arrival at each object, the user provides feedback specifying whether the object satisfies its corresponding query. The goal is to compute the next object to be visited, based on the feedback. Several heuristic algorithms are given and compared experimentally.