{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T04:15:38Z","timestamp":1749096938170,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319440385"},{"type":"electronic","value":"9783319440392"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44039-2_14","type":"book-chapter","created":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T15:01:16Z","timestamp":1471100476000},"page":"198-211","source":"Crossref","is-referenced-by-count":6,"title":["Continuous Trip Route Planning Queries"],"prefix":"10.1007","author":[{"given":"Yutaka","family":"Ohsawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Htoo","family":"Htoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tin Nilar","family":"Win","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,14]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-540-24741-8_6","volume-title":"Advances in Database Technology - EDBT 2004","author":"B Gedik","year":"2004","unstructured":"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\u00f6hm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 67\u201387. Springer, Heidelberg (2004)"},{"issue":"10","key":"14_CR2","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TC.2002.1039840","volume":"51","author":"S Prabhakar","year":"2002","unstructured":"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\u20131140 (2002)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR3","unstructured":"Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: Proceedings of 32th VLDB, pp. 43\u201354 (2006)"},{"issue":"3","key":"14_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00778-005-0166-4","volume":"15","author":"R Bentis","year":"2006","unstructured":"Bentis, R., Jensen, C.S., Kar\u010dlauskas, G., \u0160altenis, S.: Nearest and reverse nearest neighbor queries for moving objects. VLDB J. 15(3), 229\u2013250 (2006)","journal-title":"VLDB J."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: Proceeding of the 22nd International Conference on Data Engineering, p. 77 (2006)","DOI":"10.1109\/ICDE.2006.43"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Iwerks, G.S., Samet, H., Smith, K.P.: Maintenance of spatial semijoin queries on moving points. In: Proceedings of VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50073-5"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X., Yu, J.X.: Monitoring path nearest neighbor in road networks. In: SIGMOD 2009, pp. 591\u2013602 (2009)","DOI":"10.1145\/1559845.1559907"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.is.2012.02.003","volume":"37","author":"YK Huang","year":"2012","unstructured":"Huang, Y.K., Chang, C.H., Lee, C.: Continuous distance-based skyline queries in road networks. Inf. Syst. 37, 611\u2013633 (2012)","journal-title":"Inf. Syst."},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1109\/TKDE.2010.246","volume":"23","author":"MA Cheema","year":"2011","unstructured":"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\u20131199 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/11535331_16","volume-title":"Advances in Spatial and Temporal Databases","author":"F Li","year":"2005","unstructured":"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\u2013290. Springer, Heidelberg (2005)"},{"key":"14_CR11","unstructured":"Sharifzadeh, M., Kalahdouzan, M., Shahabi, C.: The optimal sequenced route query. Technical report, Computer Science Department, University of Southern California (2005)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Chen, H., Ku, W.S., Sun, M.T., Zimmermann, R.: The multi-rule partial sequenced route query. In: ACM GIS 2008, pp. 65\u201374 (2008)","DOI":"10.1145\/1463434.1463448"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10707-007-0034-z","volume":"12","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh, M., Shahabi, C.: Processing optimal sequenced route queries using voronoi diagram. Geoinformatica 12, 411\u2013433 (2008)","journal-title":"Geoinformatica"},{"issue":"7","key":"14_CR14","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/TKDE.2011.52","volume":"24","author":"S Nutanong","year":"2012","unstructured":"Nutanong, S., Tanin, E., Shao, J., Zahang, R., Ramamohanarao, K.: Continuous detour queries in spatial networks. IEEE Trans. Knowl. Data Eng. 24(7), 1201\u20131215 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-642-32281-5_19","volume-title":"Web-Age Information Management","author":"H Htoo","year":"2012","unstructured":"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\u2013209. Springer, Heidelberg (2012)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/978-3-642-32600-4_36","volume-title":"Database and Expert Systems Applications","author":"Y Ohsawa","year":"2012","unstructured":"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\u2013491. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44039-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T18:00:09Z","timestamp":1749060009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44039-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319440385","9783319440392"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44039-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}