Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chao, I., Golden, B., Wasil, E.: A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88(3), 475–489 (1996)
Chao, I., Golden, B., Wasil, E.: The team orienteering problem. European Journal of Operational Research 88, 464–474 (1996)
Chen, H., Ku, W.S., Sun, M.T., Zimmermann, R.: The multi-rule partial sequenced route query. In: GIS, pp. 1–10 (2008)
Golden, B., Wang, Q., Liu, L.: A multifaceted heuristic for the orienteering problem. Naval Research Logistics 35, 359–366 (1988)
Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics 34, 307–318 (1987)
Huang, X., Jensen, C.S.: In-route skyline querying for location-based services. In: Kwon, Y.-J., Bouju, A., Claramunt, C. (eds.) W2GIS 2004. LNCS, vol. 3428, pp. 120–135. Springer, Heidelberg (2005)
Kanza, Y., Safra, E., Sagiv, Y., Doytsher, Y.: Heuristic algorithms for route-search queries over geographical data. In: GIS, pp. 1–10 (2008)
Keller, P.C.: Algorithms to solve the orienteering problem: A comparison. European Journal of Operational Research 41, 224–231 (1989)
Leifer, A.C., Rosenwein, M.S.: Strong linear programming relaxations for the orienteering problem. European J. of Operational Research 73, 517–523 (1994)
Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.H.: On trip planning queries in spatial databases. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005)
Ma, X., Shekhar, S., Xiong, H., Zhang, P.: Exploiting a page-level upper bound for multi-type nearest neighbor queries. In: GIS, pp. 179–186 (2006)
Ramesh, R., Yoon, Y., Karwan, M.: An optimal algorithm for the orienteering tour problem. ORSA Journal on Computing 4(2), 155–165 (1992)
Safra, E., Kanza, Y., Dolev, N., Sagiv, Y., Doytsher, Y.: Computing a k-route over uncertain geographical data. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 276–293. Springer, Heidelberg (2007)
Sharifzadeh, M., Kolahdouzan, M.R., Shahabi, C.: Optimal sequenced route query. The VLDB Journal 17(8), 765–787 (2008)
Terrovitis, M., Bakiras, S., Papadias, D., Mouratidis, K.: Constrained shortest path computation. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 181–199. Springer, Heidelberg (2005)
Tsiligirides, T.: Heuristic methods applied to orienteering. Journal of the Operational Research Society 35(9), 797–809 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanza, Y., Safra, E., Sagiv, Y. (2009). Route Search over Probabilistic Geospatial Data. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-02982-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02981-3
Online ISBN: 978-3-642-02982-0
eBook Packages: Computer ScienceComputer Science (R0)