{"id":"https://openalex.org/W4285005306","doi":"https://doi.org/10.1145/3490148.3538581","title":"Parallel Cover Trees and their Applications","display_name":"Parallel Cover Trees and their Applications","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285005306","doi":"https://doi.org/10.1145/3490148.3538581"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538581","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538581","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538581","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 34th 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/3490148.3538581","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100352651","display_name":"Yan Gu","orcid":"https://orcid.org/0000-0002-4392-4022"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yan Gu","raw_affiliation_strings":["UC Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071266365","display_name":"Zachary Napier","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zachary Napier","raw_affiliation_strings":["UC Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004374151","display_name":"Yihan Sun","orcid":"https://orcid.org/0000-0002-3212-0934"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yihan Sun","raw_affiliation_strings":["UC Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060182056","display_name":"L. Wang","orcid":"https://orcid.org/0000-0002-0420-732X"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Letong Wang","raw_affiliation_strings":["UC Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100352651"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":2.231,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87805495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"259","last_page":"272"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9958999752998352,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/tree-traversal","display_name":"Tree traversal","score":0.8877788186073303},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7367073893547058},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5821435451507568},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5740835070610046},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5687629580497742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.567842960357666},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5058243274688721},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5007057189941406},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4657949209213257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4618896543979645},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45696136355400085},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.43670016527175903},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.42127302289009094},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36023953557014465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3341570794582367},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3065485656261444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.25446009635925293},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2509292960166931},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2486276924610138},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07690408825874329}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8877788186073303},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7367073893547058},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5821435451507568},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5740835070610046},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5687629580497742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.567842960357666},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5058243274688721},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5007057189941406},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4657949209213257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4618896543979645},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45696136355400085},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.43670016527175903},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.42127302289009094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36023953557014465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3341570794582367},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3065485656261444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25446009635925293},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2509292960166931},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2486276924610138},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07690408825874329},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538581","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538581","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538581","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 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3490148.3538581","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538581","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538581","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 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285005306.pdf","grobid_xml":"https://content.openalex.org/works/W4285005306.grobid-xml"},"referenced_works_count":67,"referenced_works":["https://openalex.org/W139098497","https://openalex.org/W398859631","https://openalex.org/W1547576067","https://openalex.org/W2001141328","https://openalex.org/W2007610503","https://openalex.org/W2009803313","https://openalex.org/W2016559894","https://openalex.org/W2018359542","https://openalex.org/W2020964455","https://openalex.org/W2028637981","https://openalex.org/W2031671531","https://openalex.org/W2034188144","https://openalex.org/W2035679446","https://openalex.org/W2049069130","https://openalex.org/W2056578260","https://openalex.org/W2060675879","https://openalex.org/W2064594923","https://openalex.org/W2067298033","https://openalex.org/W2083183567","https://openalex.org/W2089064856","https://openalex.org/W2092720654","https://openalex.org/W2096592175","https://openalex.org/W2101562895","https://openalex.org/W2122218279","https://openalex.org/W2132377940","https://openalex.org/W2133296809","https://openalex.org/W2134468527","https://openalex.org/W2141585940","https://openalex.org/W2145036943","https://openalex.org/W2150926065","https://openalex.org/W2151690061","https://openalex.org/W2153168552","https://openalex.org/W2153636661","https://openalex.org/W2156912724","https://openalex.org/W2167578881","https://openalex.org/W2169036209","https://openalex.org/W2240426913","https://openalex.org/W2263202512","https://openalex.org/W2497539787","https://openalex.org/W2562123954","https://openalex.org/W2562836854","https://openalex.org/W2726539084","https://openalex.org/W2738017032","https://openalex.org/W2763158813","https://openalex.org/W2804488201","https://openalex.org/W2885849839","https://openalex.org/W2963194605","https://openalex.org/W2963212338","https://openalex.org/W2968947146","https://openalex.org/W2981950971","https://openalex.org/W3028763582","https://openalex.org/W3037464308","https://openalex.org/W3041171185","https://openalex.org/W3041758129","https://openalex.org/W3088152573","https://openalex.org/W3105209461","https://openalex.org/W3124031623","https://openalex.org/W3158147474","https://openalex.org/W3169714987","https://openalex.org/W4223901115","https://openalex.org/W4237777791","https://openalex.org/W4246219036","https://openalex.org/W4256177618","https://openalex.org/W4282050459","https://openalex.org/W6639285596","https://openalex.org/W6640029517","https://openalex.org/W6733636721"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W4246757943","https://openalex.org/W2368606575","https://openalex.org/W2487311615","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455"],"abstract_inverted_index":{"The":[0],"cover":[1,75,87],"tree":[2,76,88],"is":[3],"the":[4,55,58,64,67,74],"canonical":[5],"data":[6],"structure":[7],"that":[8],"efficiently":[9],"maintains":[10],"a":[11,17],"dynamic":[12],"set":[13],"of":[14,57,69,81],"points":[15],"on":[16],"metric":[18],"space":[19],"and":[20,23,37,46,66],"supports":[21],"nearest":[22,47],"k-nearest":[24],"neighbor":[25,48],"searches.":[26],"For":[27],"most":[28],"real-world":[29],"datasets":[30],"with":[31],"reasonable":[32],"distributions":[33],"(constant":[34],"expansion":[35],"rate":[36],"bounded":[38],"aspect":[39],"ratio":[40],"mathematically),":[41],"single-point":[42,44],"insertion,":[43],"deletion,":[45],"search":[49],"(NNS)":[50],"only":[51],"cost":[52],"logarithmically":[53],"to":[54,63],"size":[56],"point":[59],"set.":[60],"Unfortunately,":[61],"due":[62],"complication":[65],"use":[68],"depth-first":[70],"traversal":[71],"order":[72],"in":[73],"algorithms,":[77],"we":[78],"were":[79],"unaware":[80],"any":[82],"parallel":[83],"approaches":[84],"for":[85],"these":[86],"algorithms.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}