{"id":"https://openalex.org/W7163393453","doi":"https://doi.org/10.48550/arxiv.2606.03129","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-06-02","ids":{"openalex":"https://openalex.org/W7163393453","doi":"https://doi.org/10.48550/arxiv.2606.03129"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.03129","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03129","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.03129","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077337403","display_name":"Xiangyun Ding","orcid":"https://orcid.org/0009-0001-8367-8399"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ding, Xiangyun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137743611","display_name":"Rohin Garg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Garg, Rohin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137765244","display_name":"Yan Gu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gu, Yan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137747657","display_name":"Yihan Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Yihan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.444599986076355,"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.444599986076355,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.1770000010728836,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.05649999901652336,"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/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7123000025749207},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6934000253677368},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.6877999901771545},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6420999765396118},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5716000199317932},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5422999858856201},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.3935999870300293},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3871999979019165}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7123000025749207},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6934000253677368},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.6877999901771545},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6420999765396118},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5716000199317932},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5422999858856201},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46880000829696655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4090999960899353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3961000144481659},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.3935999870300293},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.37059998512268066},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.362199991941452},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35530000925064087},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.35010001063346863},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.30649998784065247},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C154497576","wikidata":"https://www.wikidata.org/wiki/Q7247777","display_name":"Product metric","level":3,"score":0.25270000100135803},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.03129","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03129","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.03129","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03129","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"metric":[1,16,110],"skip-list":[2],"is":[3,46,52,140],"a":[4,29,68,117,132,152,217],"data":[5,78],"structure":[6],"designed":[7],"for":[8,76,108,170],"efficient":[9],"nearest":[10,56,174],"and":[11,39,50,105,131,186,208],"$k$-nearest":[12],"neighbor":[13,175],"search":[14],"in":[15,58],"spaces.":[17],"For":[18],"many":[19,195],"real-world":[20],"datasets":[21],"with":[22,28,135],"reasonable":[23],"distributions":[24],"-":[25,33],"specifically,":[26],"those":[27],"constant":[30,118,218],"expansion":[31,119,219],"rate":[32],"it":[34,64,73],"supports":[35],"$\\tilde{O}(n)$":[36],"construction":[37,88],"time":[38],"$O(k\\log":[40],"n)$":[41,130],"query":[42],"time,":[43],"where":[44],"$n$":[45],"the":[47,53,81,114,148,200,214],"input":[48,77],"size":[49],"$k$":[51],"number":[54],"of":[55,85,116,127,196,216],"neighbors":[57],"queries.":[59],"Notably,":[60],"unlike":[61],"alternative":[62],"approaches,":[63],"does":[65],"not":[66],"require":[67],"bounded":[69],"aspect":[70],"ratio,":[71],"making":[72],"more":[74],"flexible":[75],"distributions.":[79],"However,":[80],"inherently":[82],"sequential":[83,149],"nature":[84],"its":[86],"original":[87],"has,":[89],"to":[90,203],"our":[91,121,162,193],"knowledge,":[92,194],"precluded":[93],"any":[94],"existing":[95],"parallel":[96,104],"algorithm.":[97],"In":[98],"this":[99],"paper,":[100],"we":[101,164],"present":[102],"highly":[103],"work-efficient":[106],"algorithms":[107],"constructing":[109],"skip":[111],"lists.":[112],"Under":[113],"assumption":[115,215],"rate,":[120],"approach":[122],"achieves":[123],"an":[124],"expected":[125],"work":[126,206],"$O(n":[128],"\\log":[129],"polylogarithmic":[133,209],"span":[134],"high":[136],"probability.":[137],"Our":[138],"design":[139],"based":[141],"on":[142,213],"novel":[143],"algorithmic":[144],"insights":[145],"that":[146,155],"improves":[147],"procedure,":[150],"enabling":[151],"divide-and-conquer":[153],"strategy":[154],"facilitates":[156],"parallelism":[157],"while":[158],"maintaining":[159],"efficiency.":[160],"With":[161],"algorithms,":[163],"can":[165],"also":[166],"support":[167],"improved":[168],"bounds":[169],"relevant":[171],"applications":[172],"using":[173],"as":[176],"building":[177],"blocks,":[178],"including":[179],"bichromatic":[180],"closest":[181],"pair":[182],"(BCP),":[183],"density-based":[184],"clustering,":[185],"$k$-NN":[187],"graph":[188],"construction,":[189],"among":[190],"others.":[191],"To":[192],"these":[197],"results":[198],"represent":[199],"first":[201],"solutions":[202],"achieve":[204],"both":[205],"efficiency":[207],"span,":[210],"relying":[211],"solely":[212],"rate.":[220]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-04T00:00:00"}