{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:07:13Z","timestamp":1742800033710},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120374"},{"type":"electronic","value":"9783642120381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12038-1_20","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T10:09:03Z","timestamp":1268388543000},"page":"296-310","source":"Crossref","is-referenced-by-count":21,"title":["Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases"],"prefix":"10.1007","author":[{"given":"Ugur","family":"Demiryurek","sequence":"first","affiliation":[]},{"given":"Farnoush","family":"Banaei-Kashani","sequence":"additional","affiliation":[]},{"given":"Cyrus","family":"Shahabi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Chabini, I.: The discrete-time dynamic shortest path problem: Complexity, algorithms, and implementations. In: Transportation Research Record (1999)"},{"key":"20_CR2","unstructured":"Cho, H.-J., Chung, C.-W.: An efficient and scalable approach to cnn queries in a road network. In: VLDB (2005)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Cooke, L., Halsey, E.: The shortest route through a network with timedependent internodal transit times. Journal of Mathematical Analysis and Applications (1966)","DOI":"10.1016\/0022-247X(66)90009-6"},{"key":"20_CR4","unstructured":"Dean, B.C.: Algorithms for minimum cost paths in time-dependent networks. Networks (1999)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-02982-0_5","volume-title":"Advances in Spatial and Temporal Databases","author":"U. Demiryurek","year":"2009","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient continuous nearest neighbor query in spatial networks using euclidean restriction. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) Advances in Spatial and Temporal Databases. LNCS, vol.\u00a05644, pp. 25\u201343. Springer, Heidelberg (2009)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Pan, B., Kashani, F.B., Shahabi, C.: Towards modeling the traffic data on road networks. In: GIS-IWCTS (2009)","DOI":"10.1145\/1645373.1645376"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research\u00a017(3) (1969)","DOI":"10.1287\/opre.17.3.395"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-540-73540-3_26","volume-title":"Advances in Spatial and Temporal Databases","author":"B. George","year":"2007","unstructured":"George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: A summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.\u00a04605, pp. 460\u2013477. Springer, Heidelberg (2007)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD (1984)","DOI":"10.1145\/602259.602266"},{"key":"20_CR11","unstructured":"Halpern, J.: Shortest route with time dependent length of edges and limited delay possibilities in nodes. In: Mathematical Methods of Operations Research (1969)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/11535331_5","volume-title":"Advances in Spatial and Temporal Databases","author":"X. Huang","year":"2005","unstructured":"Huang, X., Jensen, C.S., Saltenis, S.: The island approach to nearest neighbor querying in spatial networks. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 73\u201390. Springer, Heidelberg (2005)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-73540-3_6","volume-title":"Advances in Spatial and Temporal Databases","author":"X. Huang","year":"2007","unstructured":"Huang, X., Jensen, C.S., Saltenis, S.: S-grid: A versatile approach to efficient query processing in spatial networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.\u00a04605, pp. 93\u2013111. Springer, Heidelberg (2007)"},{"key":"20_CR14","unstructured":"Inrix, http:\/\/www.inrix.com (last visited January 2, 2010)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"20_CR17","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation and Mobilitat (2004)"},{"key":"20_CR18","unstructured":"Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: VLDB (2006)"},{"key":"20_CR19","unstructured":"Navteq, http:\/\/www.navteq.com (last visited January 2, 2010)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM (1990)","DOI":"10.1145\/79147.214078"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Pallottino, S., Scutell\u00e0, M.G.: Shortest path algorithms in transportation models: Classical and innovative aspects. In: Equilibrium and Advanced Transportation Modelling (1998)","DOI":"10.1007\/978-1-4615-5757-9_11"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1007\/978-3-540-39658-1_69","volume-title":"Algorithms - ESA 2003","author":"D. Wagner","year":"2003","unstructured":"Wagner, D., Willhalm, T.: Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 776\u2013787. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Databases in Networked Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12038-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:16Z","timestamp":1606168036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12038-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120374","9783642120381"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12038-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}