{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:56:10Z","timestamp":1775638570779,"version":"3.50.1"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-0133849"],"award-info":[{"award-number":["CCR-0133849"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The problem is of significant interest in a wide variety of areas.<\/jats:p>","DOI":"10.1145\/1327452.1327494","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T18:20:10Z","timestamp":1199384410000},"page":"117-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":850,"title":["Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions"],"prefix":"10.1145","volume":"51","author":[{"given":"Alexandr","family":"Andoni","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Indyk","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[2008,1]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"e_1_2_2_2_1","unstructured":"Andoni A. and Indyk P. 2004. E2lsh: Exact Euclidean localitysensitive hashing. http:\/\/web.mit.edu\/andoni\/www\/LSH\/.  Andoni A. and Indyk P. 2004. E2lsh: Exact Euclidean localitysensitive hashing. http:\/\/web.mit.edu\/andoni\/www\/LSH\/."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109690"},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 573--582","author":"Arya S."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_2_2_8_1","volume-title":"Proceedings of the 6th International World Wide Web Conference. 391--404","author":"Broder A."},{"key":"e_1_2_2_9_1","volume-title":"Proceedings of Compression and Complexity of Sequences. 21--29","author":"Broder A.","year":"1997"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.5.419"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/369133.369172"},{"key":"e_1_2_2_12_1","volume-title":"Proceedings of the IEE Conference on Computer Vision and Pattern Recognition (CVPR).","author":"Califano A."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.12"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_2_15_1","volume-title":"Proceedings of the Symposium on Foundations of Computer Science.","author":"Charikar M."},{"key":"e_1_2_2_16_1","unstructured":"Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduct. Algorithms. 2nd Ed. MIT Press.  Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduct. Algorithms . 2nd Ed. MIT Press."},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci050403o"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of the International Conference on Very Large Databases.","author":"Gionis A."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_2_2_21_1","volume-title":"Proceedings of the Symposium on Foundations of Computer Science. 722--731","author":"Greene D."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875592"},{"key":"e_1_2_2_23_1","volume-title":"WebDB Workshop.","author":"Haveliwala T."},{"key":"e_1_2_2_24_1","volume-title":"Handbook of Discrete and Computational Geometry","author":"Indyk P."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_2_26_1","first-page":"621","volume-title":"Proceedings of the Symposium on Foundations of Computer Science.","author":"Karp R. M."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258653"},{"key":"e_1_2_2_28_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms.","author":"Krauthgamer R."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276877"},{"key":"e_1_2_2_30_1","volume-title":"Proceedings of the Symposium on Foundations of Computer Science. 577--591","author":"Linial N."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137881"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109688"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1038"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219917"},{"key":"e_1_2_2_35_1","volume-title":"Elsevier","author":"Samet H.","year":"2006"},{"key":"e_1_2_2_36_1","unstructured":"Shakhnarovich G. Darrell T. and Indyk P. Eds. Nearest Neighbor Methods in Learning and Vision. Neural Processing Information Series MIT Press.   Shakhnarovich G. Darrell T. and Indyk P. Eds. Nearest Neighbor Methods in Learning and Vision . Neural Processing Information Series MIT Press."},{"key":"e_1_2_2_37_1","volume-title":"Proceedings of the Workshop on Algorithms and Data Structures.","author":"Terasawa T."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1327452.1327494","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1327452.1327494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:51Z","timestamp":1750258671000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1327452.1327494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1145\/1327452.1327494"],"URL":"https:\/\/doi.org\/10.1145\/1327452.1327494","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]},"assertion":[{"value":"2008-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}