{"id":"https://openalex.org/W7167724101","doi":"https://doi.org/10.1145/3816782.3819182","title":"Parallel Metric Skip Lists and Nearest Neighbor Search","display_name":"Parallel Metric Skip Lists and Nearest Neighbor Search","publication_year":2026,"publication_date":"2026-07-06","ids":{"openalex":"https://openalex.org/W7167724101","doi":"https://doi.org/10.1145/3816782.3819182"},"language":null,"primary_location":{"id":"doi:10.1145/3816782.3819182","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819182","pdf_url":null,"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 38th 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://doi.org/10.1145/3816782.3819182","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077337403","display_name":"Xiangyun Ding","orcid":"https://orcid.org/0009-0001-8367-8399"},"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":"Xiangyun Ding","raw_affiliation_strings":["University of California, Riverside, Riverside, California, USA"],"raw_orcid":"https://orcid.org/0009-0001-8367-8399","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, California, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137743611","display_name":"Rohin Garg","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rohin Garg","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"],"raw_orcid":"https://orcid.org/0009-0009-9708-9489","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","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":false,"raw_author_name":"Yan Gu","raw_affiliation_strings":["University of California, Riverside, Riverside, California, USA"],"raw_orcid":"https://orcid.org/0000-0002-4392-4022","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, California, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","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":["University of California, Riverside, Riverside, California, USA"],"raw_orcid":"https://orcid.org/0000-0002-3212-0934","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, California, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93585005,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"182","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.5637000203132629,"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.5637000203132629,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.07410000264644623,"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/T11269","display_name":"Algorithms and Data Compression","score":0.04960000142455101,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/metric","display_name":"Metric (unit)","score":0.5584999918937683},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.491100013256073},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4302000105381012},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.32919999957084656},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.30410000681877136},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.26249998807907104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5591999888420105},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5584999918937683},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.491100013256073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4474000036716461},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4302000105381012},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3686999976634979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3434000015258789},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.30070000886917114},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.2590999901294708},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.25780001282691956},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2563000023365021},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.2547000050544739},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3816782.3819182","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819182","pdf_url":null,"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 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3816782.3819182","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819182","pdf_url":null,"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 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W139098497","https://openalex.org/W1985258161","https://openalex.org/W1996064221","https://openalex.org/W2008526771","https://openalex.org/W2009122662","https://openalex.org/W2020964455","https://openalex.org/W2027693953","https://openalex.org/W2028960610","https://openalex.org/W2031212151","https://openalex.org/W2065259291","https://openalex.org/W2107427524","https://openalex.org/W2122111042","https://openalex.org/W2122218279","https://openalex.org/W2125101937","https://openalex.org/W2132377940","https://openalex.org/W2133296809","https://openalex.org/W2141585940","https://openalex.org/W2147717514","https://openalex.org/W2153942313","https://openalex.org/W2165558283","https://openalex.org/W2169036209","https://openalex.org/W2279110065","https://openalex.org/W2285233685","https://openalex.org/W2785511006","https://openalex.org/W2963265099","https://openalex.org/W3037464308","https://openalex.org/W3169714987","https://openalex.org/W3211455097","https://openalex.org/W4206499008","https://openalex.org/W4210459256","https://openalex.org/W4237877977","https://openalex.org/W4285005306","https://openalex.org/W4292337066","https://openalex.org/W4366572218","https://openalex.org/W4380433185","https://openalex.org/W4391971774","https://openalex.org/W4407357395"],"related_works":[],"abstract_inverted_index":{"The":[0],"metric":[1,17],"skip":[2],"list":[3],"is":[4,44,50],"a":[5,28,66],"data":[6,76],"structure":[7],"designed":[8],"for":[9,74],"efficient":[10],"nearest":[11,54],"and":[12,36,48],"k-nearest":[13],"neighbor":[14],"search":[15],"in":[16,56],"spaces.":[18],"For":[19],"many":[20],"real-world":[21],"datasets":[22],"with":[23,27],"reasonable":[24],"distributions\u2014specifically,":[25],"those":[26],"constant":[29],"expansion":[30],"rate\u2014it":[31],"supports":[32],"\u00d5(n)":[33],"construction":[34,86],"time":[35],"O(k":[37],"log":[38],"n)":[39],"query":[40],"time,":[41],"where":[42],"n":[43],"the":[45,51,79],"input":[46,75],"size":[47],"k":[49],"number":[52],"of":[53,83],"neighbors":[55],"queries.":[57],"Notably,":[58],"unlike":[59],"alternative":[60],"approaches,":[61],"it":[62,71],"does":[63],"not":[64],"require":[65],"bounded":[67],"aspect":[68],"ratio,":[69],"making":[70],"more":[72],"flexible":[73],"distributions.":[77],"However,":[78],"inherently":[80],"sequential":[81],"nature":[82],"its":[84],"original":[85],"has,":[87],"to":[88],"our":[89],"knowledge,":[90],"precluded":[91],"any":[92],"existing":[93],"parallel":[94],"algorithm.":[95]},"counts_by_year":[],"updated_date":"2026-07-10T05:49:55.623906","created_date":"2026-07-09T00:00:00"}