{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:48:23Z","timestamp":1742921303174,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319178844"},{"type":"electronic","value":"9783319178851"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-17885-1_1528","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T10:09:30Z","timestamp":1494497370000},"page":"1097-1106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-NN Search in Time-Dependent Road Networks"],"prefix":"10.1007","author":[{"given":"Ugur","family":"Demiryurek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyrus","family":"Shahabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"unstructured":"Cho H-J, Chung C-W (2005) An efficient and scalable approach to cnn queries in a road network. In: An efficient and scalable approach to CNN queries in a road network (VLDB\u201905), Trondheim, pp 865\u2013876","key":"100642_CR121"},{"doi-asserted-by":"crossref","unstructured":"Demiryurek U, Banaei-Kashani F, Shahabi C (2010) Efficient k-nearest neighbor search in time-dependent spatial networks. In: Bringas PG, Hameurlain A, Quirchmayr G (eds) Database and expert systems applications: proceedings of the 21st international conference, part I (DEXA\u201910), Bilbao, 30 Aug\u20133 Sept 2010 Springer, Berlin\/Heidelberg, pp 432\u2013449","key":"100642_CR122","DOI":"10.1007\/978-3-642-15364-8_36"},{"doi-asserted-by":"crossref","unstructured":"Demiryurek U, Banaei-Kashani F, Shahabi C (2010) Towards k-nearest neighbor search in time-dependent spatial network databases. In: Kikuchi S, Sachdeva S, Bhalla S (eds) Databases in networked information systems: proceedings of the 6th international workshop (DNIS\u201910), Aizuwakamatsu, 29\u201331 Mar 2010, pp 296\u2013310","key":"100642_CR123","DOI":"10.1007\/978-3-642-12038-1_20"},{"doi-asserted-by":"crossref","unstructured":"Dreyfus P (1969) An appraisal of some shortest path algorithms. Oper Res 17(3): 395\u2013412. New York","key":"100642_CR124","DOI":"10.1287\/opre.17.3.395"},{"doi-asserted-by":"crossref","unstructured":"George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Proceedings of the 10th international conference on advances in spatial and temporal databases (SSTD\u201907), Boston, pp 460\u2013477","key":"100642_CR125","DOI":"10.1007\/978-3-540-73540-3_26"},{"doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD international conference on management of data (SIGMOD\u201984), Boston, pp 47\u201357","key":"100642_CR126","DOI":"10.1145\/602259.602266"},{"doi-asserted-by":"crossref","unstructured":"Huang X, Jensen CS, Saltenis S (2005) The island approach to nearest neighbor querying in spatial networks. In: Proceedings of the 9th international conference on advances in spatial and temporal databases (SSTD\u201905), Angra dos Reis, pp 73\u201390","key":"100642_CR127","DOI":"10.1007\/11535331_5"},{"doi-asserted-by":"crossref","unstructured":"Huang X, Jensen CS, Lu H, Saltenis S (2007) S-grid: a versatile approach to efficient query processing in spatial networks. In: Proceedings of the 10th international conference on advances in spatial and temporal databases (SSTD\u201907), Boston, pp 93\u2013111","key":"100642_CR128","DOI":"10.1007\/978-3-540-73540-3_6"},{"doi-asserted-by":"crossref","unstructured":"Kolahdouzan M, Shahabi C (2004) Voronoi-based k nearest neighbor search in spatial networks. In: Proceedings of the thirtieth international conference on very large data bases (VLDB\u201904), Toronto, vol 30, pp 840\u2013851","key":"100642_CR129","DOI":"10.1016\/B978-012088469-8.50074-7"},{"doi-asserted-by":"crossref","unstructured":"Papadias D, Yiu M, Mamoulis N, Tao Y (2008) Nearest neighbor queries in network databases. In: Encyclopedia of GIS. Springer, pp\u00a0772\u2013776","key":"100642_CR1210","DOI":"10.1007\/978-0-387-35973-1_864"},{"doi-asserted-by":"crossref","unstructured":"Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data (SIGMOD\u201908), Vancouver, pp 43\u201354","key":"100642_CR1211","DOI":"10.1145\/1376616.1376623"},{"key":"100642_CR1212","first-page":"309","volume-title":"Fastest-path computation","author":"D Zhang","year":"2008","unstructured":"Zhang D (2008) Fastest-path computation. In: Encyclopedia of GIS. Springer, pp\u00a0309\u2013313"}],"container-title":["Encyclopedia of GIS"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17885-1_1528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T06:48:59Z","timestamp":1569307739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-17885-1_1528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319178844","9783319178851"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17885-1_1528","relation":{},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}