{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T06:05:47Z","timestamp":1794549947200,"version":"4.9.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319178844","type":"print"},{"value":"9783319178851","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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_865","type":"book-chapter","created":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T15:35:49Z","timestamp":1505489749000},"page":"1433-1440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nearest Neighbor Query"],"prefix":"10.1007","author":[{"given":"Feng","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chang-Tien","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"865_CR1534","first-page":"459","volume-title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","author":"A Andoni","year":"2006","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of the symposium on foundations of computer science, Berkeley, pp\u00a0459\u2013468"},{"issue":"6","key":"865_CR1535","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1994","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1994) An optimal algorithm for approximate nearest neighbor in fixed dimensions. J ACM 45(6):891\u2013923","journal-title":"J ACM"},{"issue":"6","key":"865_CR1536","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount D, Netanyahu N, Silverman R, Wu A (1998) An optimal algorithm for approximate nearest neighbor searching. J ACM 45(6):891\u2013923","journal-title":"J ACM"},{"key":"865_CR1537","doi-asserted-by":"crossref","unstructured":"Berchtold S, Bohm C, Keim DA, Kriegel H (1997) A cost model for nearest neighbor search in highdimensional data space. In: Proceedings of ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS), Tucson, pp\u00a078\u201386","DOI":"10.1145\/263661.263671"},{"issue":"1","key":"865_CR1538","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover TM, Hart KJ (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"865_CR1539","first-page":"253","volume-title":"Locality sensitive hashing scheme based on p-stable distributions","author":"M Datar","year":"2004","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni V (2004) Locality sensitive hashing scheme based on p-stable distributions. In: Proceedings of the ACM symposium on computational geometry, Brooklyn, pp\u00a0253\u2013262"},{"issue":"1","key":"865_CR1540","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel RA, Bentley JL (1974) Quad trees: a data structure for retrieval on composite keys. Acta Informatica 4(1):1\u20139","journal-title":"Acta Informatica"},{"key":"865_CR1541","doi-asserted-by":"crossref","unstructured":"Fix E, Hodges JL (1951) Discriminatory analysis: nonparametric discrimination: consistency properties, Report No. 4. USAF School of Aviation Medicine, Randoph Field","DOI":"10.1037\/e471672008-001"},{"key":"865_CR1542","doi-asserted-by":"crossref","unstructured":"Fix E, Hodges JL (1952) Discriminatory analysis: nonparametric discrimination: small sample performance, Report No. 11. USAF School of Aviation Medicine, Randolph Field","DOI":"10.1037\/e471672008-001"},{"key":"865_CR1543","first-page":"47","volume-title":"R-trees: a dynamic index structure for spatial searching","author":"A Guttman","year":"1984","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD international conference on management of data, Boston, pp\u00a047\u201357"},{"issue":"2","key":"865_CR1544","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason GR, Samet H (1999) Distance browsing in spatial data-bases. ACM Trans Database Syst 24(2):265\u2013318","journal-title":"ACM Trans Database Syst"},{"issue":"1","key":"865_CR1545","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/TKDE.2006.15","volume":"18","author":"H Hu","year":"2006","unstructured":"Hu H, Lee DL (2006) Range nearestneighbor query. IEEE Trans Knowl Data Eng 18(1):78\u201391","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"865_CR1546","first-page":"604","volume-title":"Approximate nearest neighbor: towards removing the curse of dimensionality","author":"P Indyk","year":"1998","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbor: towards removing the curse of dimensionality. In: Proceedings of the symposium on theory of computing, Dallas, pp\u00a0604\u2013613"},{"issue":"8","key":"865_CR1547","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han EH, Kumar V (1999) CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. IEEE Comput 32(8):68\u201375","journal-title":"IEEE Comput"},{"key":"865_CR1548","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler EL, Lenstra JK, Rinnooy Khan AHG, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, Chichester"},{"key":"865_CR1549","first-page":"433","volume-title":"Spatial kd-tree: an indexing mechanism for spatial databases","author":"BC Ooi","year":"1987","unstructured":"Ooi BC, McDonell KJ, Sacks-Davis R (1987) Spatial kd-tree: an indexing mechanism for spatial databases. In: Proceedings of the IEEE COMPSAC conference, Tokyo, pp\u00a0433\u2013438"},{"key":"865_CR1550","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz DJ, Stearns RE, Lewis PM II (1977) An analysis of several heuristics for the traveling salesman problem. SIAM J Comput 6:563\u2013581","journal-title":"SIAM J Comput"},{"key":"865_CR1551","first-page":"71","volume-title":"Nearest neighbor queries","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of the ACM SIGMOD international conference on management of data, San Jose, pp\u00a071\u201379"},{"key":"865_CR1552","volume-title":"The design & analysis of spatial data structures","author":"H Samet","year":"1989","unstructured":"Samet H (1989) The design & analysis of spatial data structures. Addison-Wesley, Reading"},{"key":"865_CR1553","volume-title":"Applications of spatial data structures, computer graphics, image processing and GIS","author":"H Samet","year":"1990","unstructured":"Samet H (1990) Applications of spatial data structures, computer graphics, image processing and GIS. Addison-Wesley, Reading"},{"key":"865_CR1554","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R Sproull","year":"1991","unstructured":"Sproull R (1991) Refinements to nearest neighbor searching in K-dimensional trees. Algorithmica 6:579\u2013589","journal-title":"Algorithmica"}],"container-title":["Encyclopedia of GIS"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17885-1_865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T11:15:09Z","timestamp":1792149309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-3-319-17885-1_865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319178844","9783319178851"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17885-1_865","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-17885-1","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}