{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:46:46Z","timestamp":1743101206122,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914510"},{"type":"electronic","value":"9783319914527"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","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-91452-7_15","type":"book-chapter","created":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T06:43:19Z","timestamp":1526107399000},"page":"221-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finding All Nearest Neighbors with a Single Graph Traversal"],"prefix":"10.1007","author":[{"given":"Yixin","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Renata","family":"Borovica-Gajic","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Kulik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,13]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00530-009-0167-z","volume":"15","author":"M Safar","year":"2009","unstructured":"Safar, M., Ibrahimi, D., Taniar, D.: Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimed. Syst. 15(5), 295\u2013308 (2009)","journal-title":"Multimed. Syst."},{"key":"15_CR2","unstructured":"Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: VLDB, pp. 43\u201354 (2006)"},{"issue":"6","key":"15_CR3","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Krebs, F.: The k-nearest neighbour join: turbo charging the KDD process. Knowl. Inf. Syst. 6(6), 728\u2013749 (2004)","journal-title":"Knowl. Inf. Syst."},{"key":"15_CR4","unstructured":"https:\/\/techcrunch.com\/2016\/07\/18\/uber-has-completed-2-billion-rides\/"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Weinberger, R.R., Karlin-Resnick, J.: Parking in mixed-use US districts: oversupplied no matter how you slice the pie. Transp. Res. Rec.: J. Transp. Res. Board (2537), 177\u2013184 (2015)","DOI":"10.3141\/2537-19"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Patel, J.M.: Efficient evaluation of all-nearest-neighbor queries. In: ICDE, pp. 1056\u20131065 (2007)","DOI":"10.1109\/ICDE.2007.368964"},{"key":"15_CR7","first-page":"756","volume-title":"Proceedings 2004 VLDB Conference","author":"C XIA","year":"2004","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: GORDER: an efficient method for KNN join processing. In: VLDB, pp. 756\u2013767 (2004)"},{"key":"15_CR8","unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: SSDBM, pp. 297\u2013306 (2004)"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","volume":"49","author":"C Yu","year":"2007","unstructured":"Yu, C., Cui, B., Wang, S., Su, J.: Efficient index-based KNN join processing for high-dimensional data. Inf. Softw. Technol. 49(4), 332\u2013344 (2007)","journal-title":"Inf. Softw. Technol."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-13818-8_35","volume-title":"Scientific and Statistical Database Management","author":"T Emrich","year":"2010","unstructured":"Emrich, T., Graf, F., Kriegel, H.-P., Schubert, M., Thoma, M.: Optimizing all-nearest-neighbor queries with trigonometric pruning. In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol. 6187, pp. 501\u2013518. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13818-8_35"},{"issue":"6","key":"15_CR11","doi-asserted-by":"publisher","first-page":"7462","DOI":"10.1016\/j.eswa.2010.12.077","volume":"38","author":"HL Chen","year":"2011","unstructured":"Chen, H.L., Chang, Y.I.: All-nearest-neighbors finding based on the Hilbert curve. Expert Syst. Appl. 38(6), 7462\u20137475 (2011)","journal-title":"Expert Syst. Appl."},{"key":"15_CR12","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\/971697.602266"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K.L., 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":"15_CR14","first-page":"147","volume-title":"2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Takuya Akiba","year":"2013","unstructured":"Akiba, T., Iwata, Y., Kawarabayashi, K.I., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: ALENEX, pp. 147\u2013154 (2014)"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"15_CR16","unstructured":"Eklund, P.W., Kirkby, S., Pollitt, S.: A dynamic multi-source Dijkstra\u2019s algorithm for vehicle routing. In: ANZIIS, pp. 329\u2013333 (1996)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11428572_10","volume-title":"Pervasive Computing","author":"M Duckham","year":"2005","unstructured":"Duckham, M., Kulik, L.: A formal model of obfuscation and negotiation for location privacy. In: Gellersen, H.-W., Want, R., Schmidt, A. (eds.) Pervasive 2005. LNCS, vol. 3468, pp. 152\u2013170. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11428572_10"},{"issue":"6","key":"15_CR18","first-page":"492","volume":"9","author":"T Abeywickrama","year":"2016","unstructured":"Abeywickrama, T., Cheema, M.A., Taniar, D.: K-nearest neighbors on road networks: a journey in experimentation and in-memory implementation. PVLDB 9(6), 492\u2013503 (2016)","journal-title":"PVLDB"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/B978-012722442-8\/50076-8","volume-title":"Proceedings 2003 VLDB Conference","author":"Dimitris Papadias","year":"2003","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802\u2013813 (2003)"},{"key":"15_CR20","unstructured":"http:\/\/nectar.org.au\/research-cloud\/"},{"key":"15_CR21","unstructured":"http:\/\/www.dis.uniroma1.it\/challenge9\/"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB, pp. 840\u2013851 (2004)","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43\u201354. ACM (2008)","DOI":"10.1145\/1376616.1376623"},{"issue":"3","key":"15_CR24","first-page":"547","volume":"24","author":"KC Lee","year":"2012","unstructured":"Lee, K.C., Lee, W.C., Zheng, B., Tian, Y.: ROAD: a new spatial object search framework for road networks. TKDE 24(3), 547\u2013560 (2012)","journal-title":"TKDE"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Fast algorithms for the all nearest neighbors problem. In: FOCS, pp. 226\u2013232 (1983)","DOI":"10.1109\/SFCS.1983.16"},{"issue":"1","key":"15_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"PM Vaidya","year":"1989","unstructured":"Vaidya, P.M.: An O(n log n) algorithm for the all-nearest-neighbors problem. Discret. Comput. Geom. 4(1), 101\u2013115 (1989)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cag.2006.11.011","volume":"31","author":"J Sankaranarayanan","year":"2007","unstructured":"Sankaranarayanan, J., Samet, H., Varshney, A.: A fast all nearest neighbor algorithm for applications involving large point-clouds. Comput. Graph. 31(2), 157\u2013174 (2007)","journal-title":"Comput. Graph."},{"key":"15_CR28","unstructured":"Yu, C., Ooi, B.C., Tan, K.L., Jagadish, H.: Indexing the distance: an efficient method to KNN processing. In: VLDB, vol. 1, pp. 421\u2013430 (2001)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91452-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:14:41Z","timestamp":1709831681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91452-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319914510","9783319914527"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91452-7_15","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":"13 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"21 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ict.griffith.edu.au\/conferences\/dasfaa2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}