{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:52:21Z","timestamp":1725666741294},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642286346"},{"type":"electronic","value":"9783642286353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28635-3_5","type":"book-chapter","created":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T08:10:03Z","timestamp":1331107803000},"page":"51-62","source":"Crossref","is-referenced-by-count":3,"title":["Single-Source Multi-Target A* Algorithm for POI Queries on Road Network"],"prefix":"10.1007","author":[{"given":"Htoo","family":"Htoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutaka","family":"Ohsawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noboru","family":"Sonehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numeriche Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numeriche Mathematik"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SSC-4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics\u00a0SSC-4(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions of Systems Science and Cybernetics"},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"M.L. Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineeing\u00a017(6), 820\u2013833 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineeing"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: Proceeding of IEEE 23rd International Conference on Data Engineering (2007)","DOI":"10.1109\/ICDE.2007.367925"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. 29th VLDB, pp. 790\u2013801 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"5_CR6","unstructured":"Sharifzadeh, M., Kalahdouzan, M.R., Shahabi, C.: The optimal sequenced route query. Technical report, Computer Science Department, University of Southern Calfornia (2005)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Anshelevich, E., Egenhofer, M.J., Hwang, J. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 273\u2013290. Springer, Heidelberg (2005)"},{"key":"5_CR8","unstructured":"Hu, H., Lee, D.L., Lee, V.C.: Distance indexing on road networks. In: Poc. 32nd VLDB, pp. 894\u2013905 (2006)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proc. of the ACM SIGMOD Conference, pp. 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: Proc. 30th VLDB, pp. 840\u2013851 (2004)","DOI":"10.1016\/B978-012088469-8\/50074-7"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Zhu, L., Sun, Y.J.W., Mao, D., Liu, P.: Voronoi-based aggregate nearest neighbor query processing in road networks. In: ACM GIS 2010 (2010)","DOI":"10.1145\/1869790.1869876"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Shaw, K., Ioup, E., Sample, J., Abdelguerfi, M., Tabone, O.: Efficient approximation of spatial network queries using the M-tree wirh road network embedding. In: 19th International Conference on Scientific and Statistical Database Management (2007)","DOI":"10.1109\/SSDBM.2007.11"},{"key":"5_CR13","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd VLDB Conference, pp. 426\u2013435 (1997)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Ioup, E., Shaw, K., Sample, J., Abdelguerfi, M.: Efficient AKNN spatial network queries using the M-tree. In: ACM GIS 2007 (2007)","DOI":"10.1145\/1341012.1341070"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems\u00a030(2), 529\u2013576 (2005)","journal-title":"ACM Transactions on Database Systems"},{"key":"5_CR16","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: Proceedings of the 20th International Conference on Data Engineering, pp. 301\u2013312 (2004)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28635-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:03:36Z","timestamp":1620126216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28635-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642286346","9783642286353"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28635-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}