Abstract
Given a current point q, a final destination point d, and a set of data points categories to be visited during a trip, a trip route planning query (TRPQ) determines the shortest route from q to d that includes data points one each from given data points categories. After the optimal route is determined, a user may sometimes deviate from the route. In such cases, a new route is needed from the new current position \(q'\). For simple continuous queries, a method to calculate the safe-region with the query result has been proposed. The safe-region is the area where the query result is not changed. This paper proposes two efficient methods called preceeding rival addition (PRA) and tardy rival addition (TRA) algorithms to obtain the safe-region for TRPQ queries, and a basic method as a comparison method. In two proposed algorithms, PRA gives an accurate safe-region, and TRA gives an approximate safe-region very fast. We evaluate the efficiency of the proposed methods experimentally comparing to the basic method for TRPQ query.
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
References
Gedik, B., Liu, L.: MobiEyes: distributed processing of continuously moving queries on moving objects in a mobile system. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 67–87. Springer, Heidelberg (2004)
Prabhakar, S., Xia, Y., Kalashnikov, D., Aref, W., Hambrush, S.: Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects. IEEE Trans. Comput. 51(10), 1124–1140 (2002)
Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: Proceedings of 32th VLDB, pp. 43–54 (2006)
Bentis, R., Jensen, C.S., Karčlauskas, G., Šaltenis, S.: Nearest and reverse nearest neighbor queries for moving objects. VLDB J. 15(3), 229–250 (2006)
Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: Proceeding of the 22nd International Conference on Data Engineering, p. 77 (2006)
Iwerks, G.S., Samet, H., Smith, K.P.: Maintenance of spatial semijoin queries on moving points. In: Proceedings of VLDB (2004)
Chen, Z., Shen, H.T., Zhou, X., Yu, J.X.: Monitoring path nearest neighbor in road networks. In: SIGMOD 2009, pp. 591–602 (2009)
Huang, Y.K., Chang, C.H., Lee, C.: Continuous distance-based skyline queries in road networks. Inf. Syst. 37, 611–633 (2012)
Cheema, M.A., Brankovic, L., Lin, X., Zhang, W., Wang, W.: Continuous monitoring of distance based range queries. IEEE Trans. Knowl. Data Eng. 23, 1182–1199 (2011)
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., Kalahdouzan, M., Shahabi, C.: The optimal sequenced route query. Technical report, Computer Science Department, University of Southern California (2005)
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)
Sharifzadeh, M., Shahabi, C.: Processing optimal sequenced route queries using voronoi diagram. Geoinformatica 12, 411–433 (2008)
Nutanong, S., Tanin, E., Shao, J., Zahang, R., Ramamohanarao, K.: Continuous detour queries in spatial networks. IEEE Trans. Knowl. Data Eng. 24(7), 1201–1215 (2012)
Htoo, H., Ohsawa, Y., Sonehara, N., Sakauchi, M.: Optimal sequenced route query algorithm using visited POI graph. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol. 7418, pp. 198–209. Springer, Heidelberg (2012)
Ohsawa, Y., Htoo, H., Sonehara, N., Sakauchi, M.: Sequenced route query in road network distance based on incremental euclidean restriction. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part I. LNCS, vol. 7446, pp. 484–491. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Ohsawa, Y., Htoo, H., Win, T.N. (2016). Continuous Trip Route Planning Queries. In: Pokorný, J., Ivanović, M., Thalheim, B., Šaloun, P. (eds) Advances in Databases and Information Systems. ADBIS 2016. Lecture Notes in Computer Science(), vol 9809. Springer, Cham. https://doi.org/10.1007/978-3-319-44039-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-44039-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44038-5
Online ISBN: 978-3-319-44039-2
eBook Packages: Computer ScienceComputer Science (R0)