{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:07:05Z","timestamp":1749578825213},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402340"},{"type":"electronic","value":"9783642402357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40235-7_21","type":"book-chapter","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T04:47:24Z","timestamp":1374036444000},"page":"367-385","source":"Crossref","is-referenced-by-count":15,"title":["A Group Based Approach for Path Queries in Road Networks"],"prefix":"10.1007","author":[{"given":"Hossain","family":"Mahmud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashfaq Mahmood","family":"Amin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanzima","family":"Hashem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarana","family":"Nutanong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Google maps\/google earth apis terms of service, \n                    \n                      http:\/\/code.google.com\/apis\/maps\/terms.htm"},{"issue":"5","key":"21_CR2","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00778-010-0182-x","volume":"19","author":"M.E. Ali","year":"2010","unstructured":"Ali, M.E., Tanin, E., Zhang, R., Kulik, L.: A motion-aware approach for efficient evaluation of continuous queries on 3d object databases. VLDB J.\u00a019(5), 603\u2013632 (2010)","journal-title":"VLDB J."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.5"},{"key":"21_CR4","unstructured":"BingMaps, \n                    \n                      http:\/\/www.bing.com\/maps\/"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bullen, P.S.: Handbook of means and their inequalities (1987)","DOI":"10.1007\/978-94-017-2226-1"},{"key":"21_CR6","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.F.: Faster batched shortest paths in road networks. In: ATMOS, pp. 52\u201363 (2011)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 52\u201365. Springer, Heidelberg (2007)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-15364-8_36","volume-title":"Database and Expert Systems Applications","author":"U. Demiryurek","year":"2010","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient K-nearest neighbor search in time-dependent spatial networks. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part I. LNCS, vol.\u00a06261, pp. 432\u2013449. Springer, Heidelberg (2010)"},{"issue":"6","key":"21_CR9","first-page":"526","volume":"5","author":"G. Giannikis","year":"2012","unstructured":"Giannikis, G., Alonso, G., Kossmann, D.: Shareddb: Killing one thousand queries with one stone. PVLDB\u00a05(6), 526\u2013537 (2012)","journal-title":"PVLDB"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Lee, J.G., Han, J.: Trajectory clustering: A partition-and-group framework. In: SIGMOD, pp. 593\u2013604 (2007)","DOI":"10.1145\/1247480.1247546"},{"key":"21_CR11","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp. 156\u2013165 (2005)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck3, R.F.: Efficient point-to-point shortest path algorithms. Tech. Report (2005)","DOI":"10.1137\/1.9781611972863.13"},{"key":"21_CR13","unstructured":"GoogleMaps, \n                    \n                      http:\/\/maps.google.com"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-22922-0_6","volume-title":"Advances in Spatial and Temporal Databases","author":"V.M.V. Gunturi","year":"2011","unstructured":"Gunturi, V.M.V., Nunes, E., Yang, K., Shekhar, S.: A critical-time-point approach to all-start-time lagrangian shortest paths: A summary of results. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol.\u00a06849, pp. 74\u201391. Springer, Heidelberg (2011)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S. Koenig","year":"1968","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artificial Intelligence\u00a0155, 93\u2013146 (1968)","journal-title":"Artificial Intelligence"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Levandoski, J.J., Mokbel, M.F., Khalefa, M.E.: Preference query evaluation over expensive attributes. In: CIKM, pp. 319\u2013328 (2010)","DOI":"10.1145\/1871437.1871481"},{"key":"21_CR17","unstructured":"Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., Thrun, S.: Anytime dynamic A*: An anytime, replanning algorithm. In: ICAPS (2005)"},{"key":"21_CR18","unstructured":"Mahmud, H., Amin, A.M., Ali, M.E., Hashem, T.: Shared execution of path queries on road networks. CoRR, abs\/1210.6746 (2012)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Malviya, N., Madden, S., Bhattacharya, A.: A continuous query system for dynamic route planning. In: ICDE, pp. 792\u2013803 (2011)","DOI":"10.1109\/ICDE.2011.5767844"},{"key":"21_CR20","unstructured":"MapQuest, \n                    \n                      http:\/\/www.mapquest.com"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Nilson, N.J., Hart, P.E.: A formal basis of the heuristic determination of minimum cost paths\u00a04(2), 100\u2013107 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"21_CR22","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence a modern approach, 2nd edn. (2006)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"issue":"1","key":"21_CR24","first-page":"1210","volume":"2","author":"J. Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. PVLDB\u00a02(1), 1210\u20131221 (2009)","journal-title":"PVLDB"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-72845-0_6","volume-title":"Experimental Algorithms","author":"D. Schultes","year":"2007","unstructured":"Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 66\u201379. Springer, Heidelberg (2007)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/11535331_11","volume-title":"Advances in Spatial and Temporal Databases","author":"M. Terrovitis","year":"2005","unstructured":"Terrovitis, M., Bakiras, S., Papadias, D., Mouratidis, K.: Constrained shortest path computation. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 181\u2013199. Springer, Heidelberg (2005)"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Terrovitis, M., Bakiras, S., Papadia, D., Mouratidis, K.: Shortest path and distance queries on road networks: An experimental evaluation. In: PVLDB, pp. 406\u2013417 (2012)","DOI":"10.14778\/2140436.2140438"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Thomsen, J.R., Yiu, M.L., Jensen, C.S.: Effective caching of shortest paths for location-based services. In: SIGMOD, pp. 313\u2013324 (2012)","DOI":"10.1145\/2213836.2213872"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chow, C.-Y., Li, Q., Zhang, X., Xu, Y.: SMashQ: spatial mashup framework for k-nn queries in time-dependent road networks. Distributed and Parallel Databases, 259\u2013287 (2013)","DOI":"10.1007\/s10619-012-7110-6"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-44676-1_3","volume-title":"Algorithms - ESA 2001","author":"U. Zwick","year":"2001","unstructured":"Zwick, U.: Exact and approximate distances in graphs - A survey. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 33\u201348. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40235-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T23:54:04Z","timestamp":1557964444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40235-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402340","9783642402357"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40235-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}