{"id":"https://openalex.org/W2107427524","doi":"https://doi.org/10.1145/1806907.1806912","title":"Efficient and accurate nearest neighbor and closest pair search in high-dimensional space","display_name":"Efficient and accurate nearest neighbor and closest pair search in high-dimensional space","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2107427524","doi":"https://doi.org/10.1145/1806907.1806912","mag":"2107427524"},"language":"en","primary_location":{"id":"doi:10.1145/1806907.1806912","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806907.1806912","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Database Systems","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/A5048609852","display_name":"Yufei Tao","orcid":"https://orcid.org/0000-0003-3883-5452"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yufei Tao","raw_affiliation_strings":["Chinese University of Hong Kong, Sha Tin, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Sha Tin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009196125","display_name":"Ke Yi","orcid":"https://orcid.org/0000-0002-2178-3716"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ke Yi","raw_affiliation_strings":["Hong Kong University of Science and Technology, Hong Kong","Hong Kong University of Science and Technology; Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Hong Kong","institution_ids":["https://openalex.org/I200769079"]},{"raw_affiliation_string":"Hong Kong University of Science and Technology; Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102846935","display_name":"Cheng Sheng","orcid":"https://orcid.org/0000-0002-2656-6147"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Cheng Sheng","raw_affiliation_strings":["Chinese University of Hong Kong, Sha Tin, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Sha Tin, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014399734","display_name":"Panos Kalnis","orcid":"https://orcid.org/0000-0002-5060-1360"},"institutions":[{"id":"https://openalex.org/I71920554","display_name":"King Abdullah University of Science and Technology","ror":"https://ror.org/01q3tbs38","country_code":"SA","type":"education","lineage":["https://openalex.org/I71920554"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Panos Kalnis","raw_affiliation_strings":["King Abdullah University of Science and Technology, Thuwal, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King Abdullah University of Science and Technology, Thuwal, Saudi Arabia","institution_ids":["https://openalex.org/I71920554"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.4434,"has_fulltext":false,"cited_by_count":124,"citation_normalized_percentile":{"value":0.96553713,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"35","issue":"3","first_page":"1","last_page":"46"},"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.9998000264167786,"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.9998000264167786,"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.9955999851226807,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.8198990821838379},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7994201183319092},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6509410738945007},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6098734140396118},{"id":"https://openalex.org/keywords/least-significant-bit","display_name":"Least significant bit","score":0.5120144486427307},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.493203341960907},{"id":"https://openalex.org/keywords/access-method","display_name":"Access method","score":0.4661869704723358},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45518749952316284},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.43650195002555847},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.40310829877853394},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.40262308716773987},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38146525621414185},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3706686496734619},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.277693510055542},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.2583247423171997},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.15620267391204834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1543598473072052},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11410793662071228}],"concepts":[{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.8198990821838379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7994201183319092},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6509410738945007},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6098734140396118},{"id":"https://openalex.org/C4305246","wikidata":"https://www.wikidata.org/wiki/Q3885225","display_name":"Least significant bit","level":2,"score":0.5120144486427307},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.493203341960907},{"id":"https://openalex.org/C70000936","wikidata":"https://www.wikidata.org/wiki/Q4672467","display_name":"Access method","level":2,"score":0.4661869704723358},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45518749952316284},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.43650195002555847},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.40310829877853394},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.40262308716773987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38146525621414185},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3706686496734619},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.277693510055542},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.2583247423171997},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.15620267391204834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1543598473072052},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11410793662071228},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1806907.1806912","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806907.1806912","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Database Systems","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-17410","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-17410","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:repository.kaust.edu.sa:10754/561504","is_oa":false,"landing_page_url":"http://hdl.handle.net/10754/561504","pdf_url":null,"source":{"id":"https://openalex.org/S4306401596","display_name":"King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I71920554","host_organization_name":"King Abdullah University of Science and Technology","host_organization_lineage":["https://openalex.org/I71920554"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2404382843","display_name":null,"funder_award_id":"2050395","funder_id":"https://openalex.org/F4320322942","funder_display_name":"Chinese University of Hong Kong"},{"id":"https://openalex.org/G7354104055","display_name":null,"funder_award_id":"GRF 4161/07GRF 4173/08GRF 4169/09","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"},{"id":"https://openalex.org/G8536123936","display_name":null,"funder_award_id":"DAG07/08","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"}],"funders":[{"id":"https://openalex.org/F4320321592","display_name":"Research Grants Council, University Grants Committee","ror":"https://ror.org/00djwmt25"},{"id":"https://openalex.org/F4320322942","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W167817876","https://openalex.org/W1486088638","https://openalex.org/W1488719427","https://openalex.org/W1502916507","https://openalex.org/W1541459201","https://openalex.org/W1575124099","https://openalex.org/W1672197616","https://openalex.org/W1928358804","https://openalex.org/W1969357402","https://openalex.org/W1971238646","https://openalex.org/W1990111898","https://openalex.org/W1994655805","https://openalex.org/W2000830496","https://openalex.org/W2007610503","https://openalex.org/W2012833704","https://openalex.org/W2034188144","https://openalex.org/W2046144220","https://openalex.org/W2059378307","https://openalex.org/W2071572981","https://openalex.org/W2087721273","https://openalex.org/W2097042476","https://openalex.org/W2104027187","https://openalex.org/W2104232723","https://openalex.org/W2106642566","https://openalex.org/W2107627518","https://openalex.org/W2112530897","https://openalex.org/W2118269922","https://openalex.org/W2123060058","https://openalex.org/W2129875280","https://openalex.org/W2134206624","https://openalex.org/W2137565219","https://openalex.org/W2142385580","https://openalex.org/W2144182447","https://openalex.org/W2145065594","https://openalex.org/W2147717514","https://openalex.org/W2148594490","https://openalex.org/W2148781362","https://openalex.org/W2151135734","https://openalex.org/W2151700547","https://openalex.org/W2155354516","https://openalex.org/W2155502235","https://openalex.org/W2159754133","https://openalex.org/W2162006472","https://openalex.org/W2163845944","https://openalex.org/W2170037597","https://openalex.org/W2171034893","https://openalex.org/W2427881153","https://openalex.org/W2997141990","https://openalex.org/W4206499008","https://openalex.org/W4254182148","https://openalex.org/W4316652496"],"related_works":["https://openalex.org/W4289129280","https://openalex.org/W2166822184","https://openalex.org/W3096071782","https://openalex.org/W2902799860","https://openalex.org/W2170605888","https://openalex.org/W3109426791","https://openalex.org/W4287589810","https://openalex.org/W4297416079","https://openalex.org/W195926809","https://openalex.org/W2107427524"],"abstract_inverted_index":{"Nearest":[0],"Neighbor":[1],"(NN)":[2],"search":[3,109,259],"in":[4,11,32,110,225,263,294,334],"high-dimensional":[5,107,226],"space":[6,72,296],"is":[7,58,145],"an":[8,95,147],"important":[9],"problem":[10,233,317],"many":[12],"applications.":[13],"From":[14],"the":[15,45,50,82,99,129,132,137,142,165,249,269,295,316,344],"database":[16],"perspective,":[17],"a":[18,33,59,119,207,256,291],"good":[19,276],"solution":[20],"needs":[21],"to":[22,103,215,236],"have":[23],"two":[24,180,287],"properties:":[25],"(i)":[26,170,307],"it":[27],"can":[28,260,282],"be":[29,261,283],"easily":[30],"incorporated":[31],"relational":[34,111],"database,":[35],"and":[36,52,73,157,184,200,297,324,342],"(ii)":[37,185,325],"its":[38,66,78],"query":[39,53,74,85,160],"cost":[40],"should":[41],"increase":[42],"sublinearly":[43],"with":[44,191,331],"dataset":[46],"size,":[47],"regardless":[48],"of":[49,84,115,131,182,198,248,322,340],"data":[51],"distributions.":[54],"Locality-Sensitive":[55,100],"Hashing":[56],"(LSH)":[57],"well-known":[60,312],"methodology":[61],"fulfilling":[62],"both":[63],"requirements,":[64],"but":[65,126],"current":[67],"implementations":[68],"either":[69],"incur":[70],"expensive":[71],"cost,":[75],"or":[76],"abandon":[77],"theoretical":[79,332],"guarantee":[80],"on":[81],"quality":[83,124,193],"results.":[86,161,205,349],"Motivated":[87],"by":[88,93,179,195,319,337],"this,":[89],"we":[90,210],"improve":[91],"LSH":[92,134],"proposing":[94],"access":[96],"method":[97,190,313],"called":[98,220],"B-tree":[101],"(LSB-tree)":[102],"enable":[104],"fast,":[105],"accurate,":[106],"NN":[108,177],"databases.":[112],"The":[113,228],"combination":[114],"several":[116,320],"LSB-trees":[117],"forms":[118],"LSB-forest":[120],"that":[121],"has":[122,234],"strong":[123],"guarantees,":[125],"improves":[127],"dramatically":[128],"efficiency":[130],"previous":[133],"implementation":[135],"having":[136],"same":[138,345],"guarantees.":[139],"In":[140,162,278,300],"practice,":[141,279],"LSB-tree":[143,166],"itself":[144],"also":[146],"effective":[148],"index":[149],"which":[150,245],"consumes":[151],"linear":[152],"space,":[153],"supports":[154],"efficient":[155],"updates,":[156],"provides":[158],"accurate":[159,280],"our":[163,212,301,303],"experiments,":[164,302],"was":[167,305],"faster":[168],"than:":[169],"iDistance":[171],"(a":[172,187,311],"famous":[173],"technique":[174,214,304],"for":[175,231,314],"exact":[176],"search)":[178],"orders":[181,321],"magnitude,":[183,199,323,341],"MedRank":[186],"recent":[188],"approximate":[189,329],"nontrivial":[192],"guarantees)":[194],"one":[196,338],"order":[197,339],"meanwhile":[201],"returned":[202],"much":[203],"better":[204,348],"As":[206],"second":[208],"step,":[209],"extend":[211],"LSB":[213],"solve":[216],"another":[217],"classic":[218],"problem,":[219],"Closest":[221],"Pair":[222],"(CP)":[223],"search,":[224],"space.":[227],"long-term":[229],"challenge":[230],"this":[232],"been":[235],"achieve":[237],"subquadratic":[238],"running":[239,298],"time":[240,265],"at":[241,343],"very":[242,275],"high":[243],"dimensionalities,":[244],"fails":[246],"most":[247],"existing":[250],"solutions.":[251],"We":[252],"show":[253],"that,":[254],"using":[255,285],"LSB-forest,":[257],"CP":[258],"accomplished":[262],"(worst-case)":[264],"significantly":[266],"lower":[267],"than":[268,308,326],"quadratic":[270],"complexity,":[271],"yet":[272],"still":[273],"ensuring":[274],"quality.":[277],"answers":[281],"found":[284],"just":[286],"LSB-trees,":[288],"thus":[289],"giving":[290],"substantial":[292],"reduction":[293],"time.":[299],"faster:":[306],"distance":[309],"browsing":[310],"solving":[315],"exactly)":[318],"D-shift":[327],"(an":[328],"approach":[330],"guarantees":[333],"low-dimensional":[335],"space)":[336],"time,":[346],"outputs":[347]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}