{"id":"https://openalex.org/W2134414115","doi":"https://doi.org/10.1109/icde.1999.754931","title":"Fast approximate search algorithm for nearest neighbor queries in high dimensions","display_name":"Fast approximate search algorithm for nearest neighbor queries in high dimensions","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2134414115","doi":"https://doi.org/10.1109/icde.1999.754931","mag":"2134414115"},"language":"en","primary_location":{"id":"doi:10.1109/icde.1999.754931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1999.754931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","raw_type":"proceedings-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/A5059755229","display_name":"Sakti Pramanik","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Pramanik","raw_affiliation_strings":["Department of Computer Science & Engineering, Michigan State University, East Lansing, MI, USA","Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI, USA#TAB#","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100642870","display_name":"Jie Li","orcid":"https://orcid.org/0000-0001-9400-7382"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Li","raw_affiliation_strings":["Department of Computer Science & Engineering, Michigan State University, East Lansing, MI, USA","Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI, USA#TAB#","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059755229"],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":1.4672,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83183911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7736745476722717},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.7027219533920288},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6428201198577881},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6246582865715027},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6102071404457092},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5897821187973022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5548398494720459},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.529460608959198},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.5227836966514587},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.5219575762748718},{"id":"https://openalex.org/keywords/minimum-bounding-box","display_name":"Minimum bounding box","score":0.5176799297332764},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5011837482452393},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.492556631565094},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4538581967353821},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43887677788734436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3431987762451172},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3202069401741028},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.25053709745407104},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23090672492980957},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19132697582244873},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.0618167519569397}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7736745476722717},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7027219533920288},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6428201198577881},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6246582865715027},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6102071404457092},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5897821187973022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5548398494720459},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.529460608959198},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.5227836966514587},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.5219575762748718},{"id":"https://openalex.org/C147037132","wikidata":"https://www.wikidata.org/wiki/Q6865426","display_name":"Minimum bounding box","level":3,"score":0.5176799297332764},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5011837482452393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.492556631565094},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4538581967353821},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43887677788734436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3431987762451172},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3202069401741028},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25053709745407104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23090672492980957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19132697582244873},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0618167519569397},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.1999.754931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.1999.754931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2134414115"],"related_works":["https://openalex.org/W2381195555","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2182477562","https://openalex.org/W2109424811","https://openalex.org/W1595303882","https://openalex.org/W1558159560","https://openalex.org/W2148008870","https://openalex.org/W3096071782","https://openalex.org/W2366671346"],"abstract_inverted_index":{"We":[0,68],"present":[1],"a":[2,24],"fast":[3],"approximate":[4],"nearest":[5],"neighbor":[6],"(NN)":[7],"search":[8,46,57],"index":[9,28,66],"structure":[10],"called":[11],"the":[12,27,32,36,39,44,56,71,80,83],"AB-tree,":[13],"which":[14],"uses":[15],"heuristics":[16,85],"to":[17,22,50,59],"decide":[18],"whether":[19],"or":[20],"not":[21],"access":[23],"node":[25,53],"in":[26,55,64],"tree":[29],"based":[30],"on":[31],"intersecting":[33],"angle":[34,94],"and":[35,93],"weight":[37],"of":[38,43,75,82],"node.":[40],"The":[41],"goal":[42],"NN":[45,87],"algorithm":[47],"presented":[48],"is":[49],"decrease":[51],"unnecessary":[52],"accesses":[54],"due":[58],"overlap":[60],"among":[61],"bounding":[62,76],"regions":[63],"existing":[65],"structures.":[67],"have":[69],"observed":[70],"following":[72],"three":[73],"properties":[74],"hyperspheres":[77],"that":[78],"motivated":[79],"creation":[81],"proposed":[84],"for":[86],"search:":[88],"distance":[89],"property;":[90,92],"radius":[91],"property.":[95]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}