{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:26:29Z","timestamp":1742948789103,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319968926"},{"type":"electronic","value":"9783319968933"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-96893-3_25","type":"book-chapter","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T11:30:49Z","timestamp":1531999849000},"page":"334-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding the K Nearest Objects over Time Dependent Road Networks"],"prefix":"10.1007","author":[{"given":"Muxi","family":"Leng","sequence":"first","affiliation":[]},{"given":"Yajun","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Junhu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qinghua","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Chucre, M.R.R.B., do Nascimento, S.M., de Mac\u00eado, J.A.F., Monteiro, J.M., Casanova, M.A.: Taxi, please! A nearest neighbor query in time-dependent road networks. In: MDM, pp. 180\u2013185 (2016)","DOI":"10.1109\/MDM.2016.36"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Costa, C.F., Machado, J.C., Nascimento, M.A., de Mac\u00eado, J.A.F.: Aggregate k-nearest neighbors queries in time-dependent road networks. In: SIGSPATIAL, pp. 3\u201312 (2015)","DOI":"10.1145\/2834126.2834129"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Costa, C.F., Nascimento, M.A., de Mac\u00eado, J.A.F., Machado, J.C.: A*-based solutions for KNN queries with operating time constraints in time-dependent road networks. In: MDM, pp. 23\u201332 (2014)","DOI":"10.1109\/MDM.2014.9"},{"key":"25_CR4","unstructured":"Cruz, L.A., Lettich, F., J\u00fanior, L.S., Magalh\u00e3es, R.P., de Mac\u00eado, J.A.F.: Finding the nearest service provider on time-dependent road networks. In: ECML-PKDD, pp. 21\u201331 (2017)"},{"issue":"3","key":"25_CR5","first-page":"211","volume":"3","author":"LA Cruz","year":"2012","unstructured":"Cruz, L.A., Nascimento, M.A., de Mac\u00eado, J.A.F.: K-nearest neighbors queries in time-dependent road networks. JIDM 3(3), 211\u2013226 (2012)","journal-title":"JIDM"},{"key":"25_CR6","first-page":"432","volume-title":"Lecture Notes in Computer Science","author":"Ugur Demiryurek","year":"2010","unstructured":"Demiryurek, U., Kashani, F.B., Shahabi, C.: Efficient k-nearest neighbor search in time-dependent spatial networks. In: DEXA, pp. 432\u2013449 (2010)"},{"key":"25_CR7","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":"25_CR8","first-page":"191","volume":"11","author":"B George","year":"2006","unstructured":"George, B., Shekhar, S.: Time-aggregated graphs for modeling spatio-temporal networks. J. Data Semant. 11, 191\u2013212 (2006)","journal-title":"J. Data Semant."},{"key":"25_CR9","first-page":"186","volume-title":"Lecture Notes in Computer Science","author":"Haibo Hu","year":"2006","unstructured":"Hu, H., Lee, D.L., Xu, J.: Fast nearest neighbor search on road networks. In: EDBT, pp. 186\u2013203 (2006)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11535331_5","volume-title":"Advances in Spatial and Temporal Databases","author":"Xuegang Huang","year":"2005","unstructured":"Huang, X., Jensen, C.S., Saltenis, S.: The islands approach to nearest neighbor querying in spatial networks. In: SSTD, pp. 73\u201390 (2005)"},{"key":"25_CR11","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, p. 10 (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/B978-012088469-8.50074-7","volume-title":"Proceedings 2004 VLDB Conference","author":"M KOLAHDOUZAN","year":"2004","unstructured":"Kolahdouzan, M.R., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB, pp. 840\u2013851 (2004)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Komai, Y., Nguyen, D.H., Hara, T., Nishio, S.: kNN search utilizing index of the minimum road travel time in time-dependent road networks. In: SRDS, pp. 131\u2013137 (2014)","DOI":"10.1109\/SRDSW.2014.17"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Lee, K.C.K., Lee, W., Zheng, B.: Fast object search on road networks. In: EDBT, pp. 1018\u20131029 (2009)","DOI":"10.1145\/1516360.1516476"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Wei-Kleiner, F.: Finding nearest neighbors in road networks: a tree decomposition method. In: EDBT, pp. 233\u2013240 (2013)","DOI":"10.1145\/2457317.2457355"},{"issue":"2","key":"25_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00778-016-0445-2","volume":"26","author":"S Yang","year":"2017","unstructured":"Yang, S., Cheema, M.A., Lin, X., Zhang, Y., Zhang, W.: Reverse k nearest neighbors queries and spatial reverse top-k queries. VLDB J. 26(2), 151\u2013176 (2017)","journal-title":"VLDB J."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"673","DOI":"10.14778\/2732939.2732941","volume":"7","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Gao, H., Yu, J.X., Li, J.: Finding the cost-optimal path with time constraint over time-dependent graphs. Proc. VLDB Endow. 7, 673\u2013684 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Guo, Q., Tung, A.K.H., Wu, S.: Lazylsh: approximate nearest neighbor search for multiple distance functions with a single index. In: SIGMOD, pp. 2023\u20132037 (2016)","DOI":"10.1145\/2882903.2882930"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K., Zhou, L.: G-tree: an efficient index for KNN search on road networks. In: CIKM, pp. 39\u201348 (2013)","DOI":"10.1145\/2505515.2505749"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, H., Yang, X., Wang, B., Lee, W.: Range-based obstructed nearest neighbor queries. In: SIGMOD, pp. 2053\u20132068 (2016)","DOI":"10.1145\/2882903.2915234"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96893-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:37:14Z","timestamp":1710326234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96893-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968926","9783319968933"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96893-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"19 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conferences.cis.umac.mo\/apwebwaim2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}