Abstract
This paper proposes a fast trip planning query method in the road network distance. The current position, the final destination, and some number of point of interest (POI) categories visited during the trip are specified in advance. Then, the query searches the shortest route from the current position with stops at one of each specified POI category from the visiting sequence before reaching the final destination. Several such types of trip planning methods have been proposed. Among them, this paper deals with the optimal sequenced route (OSR) which is the simplest query because it has a strongest restriction on the visiting order. This paper proposes a fast incremental algorithm to find OSR candidates in the Euclidean space. Furthermore, it provides an efficient verification method for the road network distance.
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
Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.H.: On Trip Planning Queries in Spatial Databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005)
Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The optimal sequenced route query. The VLDB Journal 17, 765–787 (2008)
Chen, H., Ku, W.S., Sun, M.T., Zimmermann, R.: The multi-rule partial sequenced route query. In: ACM GIS 2008, pp. 65–74 (2008)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. 29th VLDB, pp. 790–801 (2003)
Guttman, A.: R-Trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Conference on Management of Data, pp. 47–57 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohsawa, Y., Htoo, H., Sonehara, N., Sakauchi, M. (2012). Sequenced Route Query in Road Network Distance Based on Incremental Euclidean Restriction. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32600-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-32600-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32599-1
Online ISBN: 978-3-642-32600-4
eBook Packages: Computer ScienceComputer Science (R0)