{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:09:12Z","timestamp":1760404152568},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458137"},{"type":"electronic","value":"9783319458144"}],"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-45814-4_1","type":"book-chapter","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T22:23:54Z","timestamp":1473978234000},"page":"3-14","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Nearest Neighbor Query in Traffic-Aware Spatial Networks"],"prefix":"10.1007","author":[{"given":"Shuo","family":"Shang","sequence":"first","affiliation":[]},{"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Ji-Rong","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Shunzhi","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,17]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205\u2013216 (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT, pp. 347\u2013358 (2010)","DOI":"10.1145\/1739041.1739084"},{"issue":"2","key":"1_CR5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H Jagadish","year":"2005","unstructured":"Jagadish, H., Ooi, B., Tan, K.-L., Yu, C., Zhang, R.: iDistance: an adaptive B+-tree based indexing method for nearest neighbour search. ACM TODS 30(2), 364\u2013397 (2005)","journal-title":"ACM TODS"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Jensen, C.S., Kolarvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: ACM GIS, pp. 1\u20138 (2003)","DOI":"10.1145\/956676.956677"},{"key":"1_CR7","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":"1_CR8","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Shang, S., Deng, K., Xie, K.: Best point detour query in road networks. In: ACM GIS, pp. 71\u201380 (2010)","DOI":"10.1145\/1869790.1869804"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Shang, S., Ding, R., Yuan, B., Xie, K., Zheng, K., Kalnis, P.: User oriented trajectory search for trip recommendation. In: EDBT, pp. 156\u2013167 (2012)","DOI":"10.1145\/2247596.2247616"},{"issue":"3","key":"1_CR11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s00778-013-0331-0","volume":"23","author":"S Shang","year":"2014","unstructured":"Shang, S., Ding, R., Zheng, K., Jensen, C.S., Kalnis, P., Zhou, X.: Personalized trajectory matching in spatial networks. VLDB J. 23(3), 449\u2013468 (2014)","journal-title":"VLDB J."},{"issue":"4","key":"1_CR12","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s10707-015-0227-9","volume":"19","author":"S Shang","year":"2015","unstructured":"Shang, S., Liu, J., Zheng, K., Lu, H., Pedersen, T.B., Wen, J.: Planning unobstructed paths in traffic-aware spatial networks. GeoInformatica 19(4), 723\u2013746 (2015)","journal-title":"GeoInformatica"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-3-642-40235-7_8","volume-title":"Advances in Spatial and Temporal Databases","author":"S Shang","year":"2013","unstructured":"Shang, S., Lu, H., Pedersen, T.B., Xie, X.: Finding traffic-aware fastest paths in spatial networks. In: Nascimento, M.A., Sellis, T., Cheng, R., Sander, J., Zheng, Y., Kriegel, H.-P., Renz, M., Sengstock, C. (eds.) SSTD 2013. LNCS, vol. 8098, pp. 128\u2013145. Springer, Heidelberg (2013)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Shang, S., Lu, H., Pedersen, T.B., Xie, X.: Modeling of traffic-aware travel time in spatial networks. In: 2013 IEEE 14th International Conference on Mobile Data Management, 3\u20136 June 2013, Milan, Italy, vol. 1, pp. 247\u2013250 (2013)","DOI":"10.1109\/MDM.2013.34"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Shang, S., Yuan, B., Deng, K., Xie, K., Zhou, X.: Finding the most accessible locations: reverse path nearest neighbor query in road networks. In: GIS, pp. 181\u2013190 (2011)","DOI":"10.1145\/2093973.2093999"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB, pp. 287\u2013298 (2002)","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: ICDE, pp. 136\u2013147 (2014)","DOI":"10.1109\/ICDE.2014.6816646"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45814-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:55:22Z","timestamp":1498330522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45814-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458137","9783319458144"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45814-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}