{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:49:16Z","timestamp":1742986156267,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319250861"},{"type":"electronic","value":"9783319250878"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25087-8_10","type":"book-chapter","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T14:11:35Z","timestamp":1444140695000},"page":"103-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Finding Near Neighbors Through Local Search"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"Ruiz","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Graff","sequence":"additional","affiliation":[]},{"given":"Eric S.","family":"T\u00e9llez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised kd-trees for fast image descriptor matching. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2008, pp. 1\u20138, June 2008","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"10_CR2","unstructured":"Arya, S., Mount, D.M.: Approximate nearest neighbor queries in fixed dimensions. In: Proceedings of the Fourth Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms, pp. 271\u2013280, Austin, Texas, 25\u201327 January 1993 (1993)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-41062-8_3","volume-title":"Similarity Search and Applications","author":"ME Houle","year":"2013","unstructured":"Houle, M.E., Nett, M.: Rank cover trees for nearest neighbor search. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 16\u201329. Springer, Heidelberg (2013)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32153-5_10","volume-title":"Similarity Search and Applications","author":"Y Malkov","year":"2012","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces. In: Navarro, G., Pestov, V. (eds.) SISAP 2012. LNCS, vol. 7404, pp. 132\u2013147. Springer, Heidelberg (2012)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Information Systems 45, 61\u201368 (2014)","journal-title":"Information Systems"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.is.2015.02.001","volume":"51","author":"E Ch\u00e1vez","year":"2015","unstructured":"Ch\u00e1vez, E., Graff, M., Navarro, G., T\u00e9llez, E.: Near neighbor searching with K nearest references. Information Systems 51, 43\u201361 (2015)","journal-title":"Information Systems"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25087-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:49:48Z","timestamp":1559260188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25087-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319250861","9783319250878"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25087-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}