{"id":"https://openalex.org/W2088101210","doi":"https://doi.org/10.1137/s0097539798347177","title":"Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces","display_name":"Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2088101210","doi":"https://doi.org/10.1137/s0097539798347177","mag":"2088101210"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798347177","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798347177","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036104549","display_name":"Eyal Kushilevitz","orcid":"https://orcid.org/0009-0009-9277-3863"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Eyal Kushilevitz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020375635","display_name":"Rafail Ostrovsky","orcid":"https://orcid.org/0000-0002-1501-1330"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rafail Ostrovsky","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010842984","display_name":"Yuval Rabani","orcid":"https://orcid.org/0000-0001-7772-2544"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Rabani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036104549"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6021,"has_fulltext":false,"cited_by_count":249,"citation_normalized_percentile":{"value":0.96229092,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"30","issue":"2","first_page":"457","last_page":"474"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6912985444068909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5158595442771912},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5058860182762146},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.49455544352531433},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4678196609020233},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4628312885761261},{"id":"https://openalex.org/keywords/cube","display_name":"Cube (algebra)","score":0.4558696448802948},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4551617205142975},{"id":"https://openalex.org/keywords/hamming-space","display_name":"Hamming space","score":0.4526982605457306},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.44480663537979126},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44339799880981445},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.43370530009269714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41757601499557495},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4144706130027771},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3948661684989929},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3390401005744934},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.19941669702529907},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.18602097034454346},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10175654292106628}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6912985444068909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5158595442771912},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5058860182762146},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.49455544352531433},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4678196609020233},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4628312885761261},{"id":"https://openalex.org/C53051483","wikidata":"https://www.wikidata.org/wiki/Q861555","display_name":"Cube (algebra)","level":2,"score":0.4558696448802948},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4551617205142975},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.4526982605457306},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.44480663537979126},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44339799880981445},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.43370530009269714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41757601499557495},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4144706130027771},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3948661684989929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3390401005744934},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.19941669702529907},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.18602097034454346},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10175654292106628},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539798347177","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798347177","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1997744504","https://openalex.org/W2028293361","https://openalex.org/W2061845601","https://openalex.org/W2067994867","https://openalex.org/W2096086248","https://openalex.org/W2122111042","https://openalex.org/W2144679084","https://openalex.org/W2147152072","https://openalex.org/W2176446742","https://openalex.org/W2979473749","https://openalex.org/W4238284510"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W2902799860","https://openalex.org/W2245581955","https://openalex.org/W3096071782","https://openalex.org/W4289129280","https://openalex.org/W1595303882","https://openalex.org/W2036753599","https://openalex.org/W2977099505","https://openalex.org/W2979980909"],"abstract_inverted_index":{"We":[0,61],"address":[1,63],"the":[2,52,59,71,76,96,99,114,118,120,126,129],"problem":[3,65],"of":[4,22,25,85,98,128],"designing":[5],"data":[6,39,89],"structures":[7,90],"that":[8,41,104],"allow":[9,43],"efficient":[10],"search":[11,102],"for":[12,51],"approximate":[13],"nearest":[14],"neighbors.":[15],"More":[16],"specifically,":[17],"given":[18,47],"a":[19,23,37,48],"database":[20,100],"consisting":[21],"set":[24],"vectors":[26],"in":[27,58,75,95,106,113,125],"some":[28],"high":[29],"dimensional":[30],"Euclidean":[31],"space,":[32],"we":[33,87],"want":[34],"to":[35,45],"construct":[36,88],"space-efficient":[38],"structure":[40],"would":[42],"us":[44],"search,":[46],"query":[49],"vector,":[50],"closest":[53,56],"or":[54,110],"nearly":[55,108,111],"vector":[57],"database.":[60],"also":[62],"this":[64],"when":[66],"distances":[67],"are":[68,123],"measured":[69],"by":[70],"L1":[72],"norm":[73],"and":[74,81,101],"Hamming":[77],"cube.":[78],"Significantly":[79],"improving":[80],"extending":[82],"recent":[83],"results":[84],"Kleinberg,":[86],"whose":[91],"size":[92,97,127],"is":[93],"polynomial":[94],"algorithms":[103],"run":[105],"time":[107],"linear":[109],"quadratic":[112],"dimension.":[115],"(Depending":[116],"on":[117],"case,":[119],"extra":[121],"factors":[122],"polylogarithmic":[124],"database.)":[130]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":35},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}