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
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
Path branch points in mobile navigation
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
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
| Hi-index | 0.00 |
In a route search over geospatial data, a user provides terms for specifying types of geographical entities that she wishes to visit. The goal is to find a route that (1) starts at a given location, (2) ends at a given location, and (3) travels via geospatial entities that are relevant to the provided search terms. Earlier work studied the problem of finding a route that is effective in the sense that its length does not exceed a given limit, the relevancy of the objects is as high as possible, and the route visits a single object from each specified type. This paper investigates route search over probabilistic geospatial data . It is shown that the notion of an effective route requires a new definition and, specifically, two alternative semantics are proposed. Computing an effective route is more complicated, compared to the non-probabilistic case, and hence necessitates new algorithms. Heuristic methods for computing an effective route, under either one of the two semantics, are developed. (Note that the problem is NP-hard.) These methods are compared analytically and experimentally. In particular, experiments on both synthetic and real-world data illustrate the efficiency and effectiveness of these methods in computing a route under the two semantics.