{"id":"https://openalex.org/W4412480919","doi":"https://doi.org/10.1145/3694906.3743339","title":"CLEANN: Lock-Free Augmented Trees for Low-Dimensional \u03ba-Nearest Neighbor Search","display_name":"CLEANN: Lock-Free Augmented Trees for Low-Dimensional \u03ba-Nearest Neighbor Search","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412480919","doi":"https://doi.org/10.1145/3694906.3743339"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743339","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743339","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743339","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743339","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108063116","display_name":"M. Manohar","orcid":"https://orcid.org/0009-0003-1038-8846"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Magdalen Dobson Manohar","raw_affiliation_strings":["Microsoft Azure, Redmond, WA, USA"],"raw_orcid":"https://orcid.org/0009-0003-1038-8846","affiliations":[{"raw_affiliation_string":"Microsoft Azure, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081860460","display_name":"Yuanhao Wei","orcid":"https://orcid.org/0000-0002-5176-0961"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Yuanhao Wei","raw_affiliation_strings":["University of British Columbia, Vancouver, BC, Canada"],"raw_orcid":"https://orcid.org/0000-0002-5176-0961","affiliations":[{"raw_affiliation_string":"University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-0224-9187","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108063116"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":1.2617,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.80577012,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"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.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9850999712944031,"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/lock","display_name":"Lock (firearm)","score":0.7065905332565308},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6805384755134583},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5096476078033447},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.45233580470085144},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2620593011379242},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08191496133804321}],"concepts":[{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.7065905332565308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6805384755134583},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5096476078033447},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.45233580470085144},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2620593011379242},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08191496133804321},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743339","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743339","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743339","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743339","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743339","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743339","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1814763051","display_name":"AF: Small: Shared-Memory Parallel Algorithms: Theory and Practice","funder_award_id":"1910030","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5612131301","display_name":null,"funder_award_id":"CCF- 1901381, CCF-1910030, and CCF-1919223","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G6550909468","display_name":null,"funder_award_id":"CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7587430710","display_name":"SHF: Medium: Algorithmic lambda-Calculus for the Design, Analysis, and Implementation of Parallel Algorithms","funder_award_id":"1901381","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G82646606","display_name":"SPX: Parallel Models and Algorithms for Emerging Memory Systems","funder_award_id":"1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412480919.pdf","grobid_xml":"https://content.openalex.org/works/W4412480919.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1495128589","https://openalex.org/W1571317019","https://openalex.org/W1992044086","https://openalex.org/W2064710146","https://openalex.org/W2101939036","https://openalex.org/W2105045857","https://openalex.org/W2115501946","https://openalex.org/W2130567155","https://openalex.org/W2153226019","https://openalex.org/W2161854574","https://openalex.org/W2169351022","https://openalex.org/W2261964959","https://openalex.org/W2277640677","https://openalex.org/W2420179792","https://openalex.org/W2431458507","https://openalex.org/W2474189218","https://openalex.org/W2569313085","https://openalex.org/W3021552947","https://openalex.org/W3133195734","https://openalex.org/W3169714987","https://openalex.org/W4214886506","https://openalex.org/W4377300645"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455","https://openalex.org/W2119808169"],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,25,42,57,59,99],"linearizable":[3,86,133],"lock-free":[4,134],"data":[5,22],"structure,":[6,144],"the":[7,45,71,76,107,132,143,158,162,165],"CLEANN-tree":[8,52,92],"(Concurrent":[9],"Linearizable":[10],"Efficient":[11],"Augmented":[12],"Nearest":[13],"Neighbor":[14],"tree),":[15],"for":[16,66,70],"low":[17],"dimensional":[18],"\u03ba-nearest-neighbor":[19],"searching.":[20],"The":[21,51],"structure":[23],"maintains":[24],"set":[26],"of":[27,61,106,142],"points":[28,48],"P":[29],"in":[30,49,102,131],"d":[31],"dimensions":[32],"under":[33],"insertion":[34],"and":[35,123,149],"deletion,":[36],"while":[37],"supporting":[38],"queries":[39,137],"that,":[40],"given":[41],"point,":[43],"return":[44],"k":[46],"nearest":[47],"P.":[50],"is":[53,75,129],"constructed":[54],"by":[55,116],"modifying":[56],"kd-tree,":[58],"type":[60],"spatial":[62],"decomposition":[63],"commonly":[64],"used":[65],"\u03ba-nearest":[67],"neighbor":[68],"searching,":[69],"concurrent":[72,79],"environment.":[73],"It":[74],"first":[77],"such":[78],"structure---two":[80],"previous":[81],"structures":[82],"were":[83],"either":[84],"not":[85],"or":[87,152],"only":[88],"supported":[89],"\u03ba=1.":[90],"Furthermore":[91],"stores":[93],"an":[94,150],"augmented":[95,127,159],"value":[96],"(more":[97],"specifically,":[98],"bounding":[100,110],"box)":[101],"each":[103],"internal":[104],"node":[105],"kd-tree.":[108],"These":[109],"boxes":[111],"significantly":[112],"improve":[113],"query":[114],"performance":[115],"allowing":[117],"more":[118],"aggresive":[119],"pruning.":[120],"However,":[121],"correctly":[122],"efficiently":[124],"maintaining":[125],"these":[126],"values":[128,160],"challenging":[130],"setting":[135],"because":[136],"can":[138,154],"examine":[139],"large":[140],"parts":[141],"which":[145],"might":[146],"be":[147],"changing,":[148],"insert":[151],"delete":[153],"require":[155],"updating":[156],"all":[157],"from":[161],"leaf":[163],"to":[164],"root.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}